publication . Preprint . 2015

Graphs with Eulerian unit spheres

Knill, Oliver;
Open Access English
  • Published: 12 Jan 2015
Abstract
d-spheres in graph theory are inductively defined as graphs for which all unit spheres S(x) are (d-1)-spheres and that the removal of one vertex renders the graph contractible. Eulerian d-spheres are geometric d-spheres which are d+1 colorable. We prove here that G is an Eulerian sphere if and only if the degrees of all the (d-2)-dimensional sub-simplices in G are even. This generalizes a Kempe-Heawood result for d=2 and is work related to the conjecture that all d-spheres have chromatic number d+1 or d+2 which is based on the geometric conjecture that every d-sphere can be embedded in an Eulerian (d+1)-sphere. For d=2, such an embedding into an Eulerian 3-spher...
Subjects
free text keywords: Mathematics - Combinatorics, Computer Science - Discrete Mathematics, 05C15, 05C10, 57M15
Download from
21 references, page 1 of 2

[1] M. Berger. A Panoramic View of Riemannian Geometry. Springer Verlag, Berlin, 2003.

[2] H.S.M. Coxeter. Regular Polytopes. Dover Publications, New York, 1973.

[3] S. Fisk. Geometric coloring theory. Advances in Math., 24(3):298{340, 1977. [OpenAIRE]

[4] R. Forman. A discrete Morse theory for cell complexes. In Geometry, topology, and physics, Conf. Proc. Lecture Notes Geom. Topology, IV, pages 112{125. Int. Press, Cambridge, MA, 1995.

[5] B. Grunbaum. Convex Polytopes. Springer, 2003.

[6] I. Izmestiev, R.B.Kusner, G.Rote, B. Springborn, and J.M. Sullivan. There is no triangulation of the torus with vertex degrees 5,6,....,6,7 and related results: geometric proofs for combinatorial theorems. Geom. Dedicata, 166:15{29, 2013. [OpenAIRE]

[7] C. Goodman-Strauss J.H. Conway, H.Burgiel. The Symmetries of Things. A.K. Peterse, Ltd., 2008.

[8] F. Josellis and O. Knill. A Lusternik-Schnirelmann theorem for graphs. http://arxiv.org/abs/1211.0750, 2012. [OpenAIRE]

[9] O. Knill. On nonconvex caustics of convex billiards. Elemente der Mathematik, 53:89{106, 1998.

[10] O. Knill. A graph theoretical Gauss-Bonnet-Chern theorem. http://arxiv.org/abs/1111.5395, 2011. [OpenAIRE]

[11] O. Knill. A discrete Gauss-Bonnet type theorem. Elemente der Mathematik, 67:1{17, 2012.

[12] O. Knill. A Brouwer xed point theorem for graph endomorphisms. Fixed Point Theory and Applications, 85, 2013.

[13] O. Knill. The Dirac operator of a graph. http://http://arxiv.org/abs/1306.2166, 2013.

[14] O. Knill. Classical mathematical structures within topological graph theory. http://arxiv.org/abs/1402.2029, 2014. [OpenAIRE]

[15] O. Knill. Coloring graphs using topology. http://arxiv.org/abs/1410.3173, 2014. [OpenAIRE]

21 references, page 1 of 2
Powered by OpenAIRE Open Research Graph
Any information missing or wrong?Report an Issue