On the construction of 3-chromatic hypergraphs with few edges

DOI10.1016/j.jcta.2013.04.007zbMath1314.05064OpenAlexW1987962029MaRDI QIDQ2349182

Heidi Gebauer

Publication date: 19 June 2015

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

Full work available at URL: https://doi.org/10.1016/j.jcta.2013.04.007

zbMATH Keywords

hypergraphextremal problemproperty Bconstructive bound

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (11)

Chain method for panchromatic colorings of hypergraphs ⋮ A note on two-colorability of nonuniform hypergraphs ⋮ A General Framework for Hypergraph Coloring ⋮ The intersection spectrum of 3‐chromatic intersecting hypergraphs ⋮ A note on panchromatic colorings ⋮ Extremal problems in hypergraph colourings ⋮ Selective hypergraph colourings ⋮ On the construction of non-2-colorable uniform hypergraphs ⋮ Improved Bounds for Uniform Hypergraphs without Property B ⋮ Chip games and paintability ⋮ \((2, 2)\)-colourings and clique-free \(\sigma\)-hypergraphs

This page was built for publication: On the construction of 3-chromatic hypergraphs with few edges