Coloring \(d\)-embeddable \(k\)-uniform hypergraphs

DOI10.1007/s00454-014-9641-2zbMath1306.05060arXiv1209.4879OpenAlexW1528271184WikidataQ41889455 ScholiaQ41889455MaRDI QIDQ2514227

Carl Georg Heise, Oleg Pikhurko, Anusch Taraz, Konstantinos D. Panagiotou

Publication date: 3 February 2015

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1209.4879

zbMATH Keywords

embeddingshypergraphschromatic numbercoloringfour color theorem

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items

Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs ⋮ Transversals and colorings of simplicial spheres ⋮ On three measures of non-convexity ⋮ Chromatic numbers of simplicial manifolds

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hardness of embedding simplicial complexes in \(\mathbb R^d\)
• Heawood inequalities
• On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
• Asymptotic lower bounds for Ramsey functions
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Some minimal nonembeddable complexes
• Extremal problems for geometric hypergraphs
• On the generation of oriented matroids
• A theorem on cyclic polytopes
• A Nonpolyhedral Triangulated Mobius Strip
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
• Higher-Dimensional analogs of the four-color problem and some inequalities for simplicial complexes
• Approximating Embeddings of Polyhedra In Codimension Three