Heawood inequalities

DOI10.1016/0097-3165(87)90076-8zbMath0628.05029OpenAlexW2913166830MaRDI QIDQ1092918

Karanbir Singh Sarkaria

Publication date: 1987

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(87)90076-8

zbMATH Keywords

simplicial complexchromatic numbersurfacesplanar graphpseudomanifoldHeawood inequality

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15) Coloring of graphs and hypergraphs (05C15)

Related Items

An extended Euler-Poincaré theorem ⋮ On Multicolor Ramsey Numbers and Subset Coloring of Hypergraphs ⋮ Generalized Heawood numbers ⋮ Coloring \(d\)-embeddable \(k\)-uniform hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Kneser colorings of polyhedra
• Addendum to may paper On coloring manifolds
• On coloring manifolds
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Extremal problems for finite sets and convex hulls---a survey
• A simple proof of the Kruskal-Katona theorem
• The chromatic number of a class of pseudo-2-manifolds
• On Neighbourly Triangulations
• A Trace Formula for Compact Manifolds
• HYPERGRAPHS
• On chromatic number of graphs and set-systems
• An inequality for the chromatic number of a graph
• Higher-Dimensional analogs of the four-color problem and some inequalities for simplicial complexes