Unit distance graphs with ambiguous chromatic numberReportar como inadecuado



 Unit distance graphs with ambiguous chromatic number


Unit distance graphs with ambiguous chromatic number - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Descargar gratis o leer online en formato PDF el libro: Unit distance graphs with ambiguous chromatic number
First Laszlo Szekely and more recently Saharon Shelah and Alexander Soifer have presented examples of infinite graphs whose chromatic numbers depend on the axioms chosen for set theory. The existence of such graphs may be relevant to the Chromatic Number of the Plane problem. In this paper we construct a new class of graphs with ambiguous chromatic number. They are unit distance graphs with vertex set R^n, and hence may be seen as further evidence that the chromatic number of the plane might depend on set theory.



Autor: Michael S. Payne

Fuente: https://archive.org/







Documentos relacionados