Graph complements of cylic graphs are homotopic to spheres or wedge sums of spheres. Their unit spheres are graph complements of path graphs and have Gauss-Bonnet curvature which converges to a limit.
The Shannon capacity of a connection graph is computed.
The Mickey mouse theorem assures that a connected positive curvature graph of positive dimension is a sphere.
The parametrized poincare-hopf theorem allows to see the f-vector of a graph in terms of the f-vector s of parts of the unit spheres of the graph.
We prove that any discrete surface has an Eulerian edge refinement. For a 2-disk, an Eulerian edge refinement is possible if and only if the boundary length is divisible by 3
Over spring break, the Helmholtz paper [PDF] has finished. (Posted now on “On Helmholtz free energy for finite abstract simplicial complexes”.) As I will have little time … ….
This is a research in progress note while finding a proof of a conjecture formulated in the unimodularity theorem paper.
The proof of the unimodularity theorem is finished.
The following picture illustrates the Euler and Fredholm theme in the special case of the prime graphs introduced in the Counting and Cohomology paper. The story there … ….