• Corpus ID: 6854309

Coloring graphs using topology

  title={Coloring graphs using topology},
  author={Oliver Knill},
  • O. Knill
  • Published 22 December 2014
  • Mathematics
  • ArXiv
Higher dimensional graphs can be used to colour two-dimensional geometric graphs. If G the boundary of a three dimensional graph H for example, we can refine the interior until it is colourable with 4 colours. The later goal is achieved if all interior edge degrees are even. Using a refinement process which cuts the interior along surfaces we can adapt the degrees along the boundary of that surface. More efficient is a self-cobordism of G with itself with a host graph discretizing the product… 
Eulerian edge refinements, geodesics, billiards and sphere coloring
This work constructs some ergodic billiards in 2-balls, where the geodesics bouncing off at the boundary symmetrically and which visit every interior edge exactly once, and tells that every 2-ball can be edge refined using interior edges to become Eulerian if and only if its boundary has length divisible by 3.
Graphs with Eulerian unit spheres
It is proved 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.
The graph spectrum of barycentric refinements
It is proved that for any finite simple graph G, the spectral functions F(G(m) of successive refinements converge for m to infinity uniformly on compact subsets of (0,1) and exponentially fast to a universal limiting eigenvalue distribution function F which only depends on the clique number respectively the dimension d of the largest complete subgraph of G and not on the starting graph G.
A simple sphere theorem for graphs
A "geomag lemma" is used which shows that every geodesic in G can be extended to an immersed 2-graph S of positive curvature and must so be a 2-sphere withpositive curvature.
Combinatorial manifolds are Hamiltonian
This paper proves that all connected d-graphs are Hamiltonian for positive d, a type of combinatorial manifold which is inductively defined as a finite simple graph for which every unit sphere is a (d-1)-sphere.
Coloring Discrete Manifolds
Discrete d-manifolds are classes of finite simple graphs which can triangulate classical manifolds but which are defined entirely within graph theory. We show that the chromatic number X(G) of a
A Sard theorem for graph theory
Eigenfunctions of geometric graphs and especially the second eigenvector of 3-spheres, which by Courant-Fiedler has exactly two nodal regions, are illustrated.
Sphere geometry and invariants
It is proved that the Poincare-Hopf value i(x)=1-X(S(x), where X is Euler characteristics and S(x) is the unit sphere of a vertex x in G1, agrees with the Green function value g(x,x), the diagonal element of the inverse of (1+A'), where A' is the adjacency matrix of G'.
If G is the category of finite simple graphs G = (V,E), the linear space V of valuations on G has a basis given by the f-numbers vk(G) counting complete subgraphs Kk+1 in G. The barycentric
The Jordan-Brouwer theorem for graphs
We prove a discrete Jordan-Brouwer-Schoenflies separation theorem telling that a (d-1)-sphere H embedded in a d-sphere G defines two different connected graphs A,B in G such a way that the


Locally planar toroidal graphs are 5-colorable
If a graph can be embedded in a torus in such a way that all noncontractible cycles have length at least 8, then its vertices may be 5-colored. The conclusion remains true when some noncontractible
Let S be a finite or infinite set in the Euclidean space 3E . We definte the graph G(S) on the vertex-set S by joining x,y c S iff p(x,y) / = their distance / is 1 . In this paper we investigate
Convex Polytopes
Graphs, Graphs and Realizations Before proceeding to the graph version of Euler’s formula, some notation will be introduced. A (finite) abstract graph G consists of two sets, the set of vertices V =
Curvature from Graph Colorings
It is proved that E[i_f(x)] is equal to curvature K(x) satisfying Gauss-Bonnet sum_x K( x) = \chi(G), where the expectation is the average over the finite probability space containing the C(c) possible colorings with c colors, for which each coloring has the same probability.
Chromatic Graph Theory
Beginning with the origin of the four color problem in 1852, the field of graph colorings has developed into one of the most popular areas of graph theory. Introducing graph theory with a coloring
The Euler characteristic of an even-dimensional graph
The Euler characteristic has an interpretation in the continuum for compact 4-manifolds M: the Euler curvature K(x), the integrand in the classical Gauss-Bonnet-Chern theorem, can be seen as an average over a probability space W of 1-K(x,w)/2 with curvatures K( x,w) of compact 2-man ifolds M(w).
An index formula for simple graphs
It is proved that any odd dimensional geometric graph G has zero curvature, and the same integral geometric index formula is valid if f is a Morse function and if S(x) is a sufficiently small geodesic sphere around x and B(f,x) intersected with the level surface.
The Mathematical Coloring Book: Mathematics of Coloring and the Colorful Life of its Creators
Merry-Go-Round.- A Story of Colored Polygons and Arithmetic Progressions.- Colored Plane.- Chromatic Number of the Plane: The Problem.- Chromatic Number of the Plane: An Historical Essay.-
On the Dimension and Euler characteristic of random graphs
It is shown here that the average dimension E[dim] is a computable polynomial of degree n(n-1)/2 in p and the explicit formulas for the signature polynomials f and g allow experimentally to explore limiting laws for the dimension of large graphs.
There is no triangulation of the torus with vertex degrees 5, 6, ... , 6, 7 and related results: geometric proofs for combinatorial theorems
There is no 5,7-triangulation of the torus, that is, no triangulation with exactly two exceptional vertices, of degree 5 and 7. Similarly, there is no 3,5-quadrangulation. The vertices of a