On the construction of 3-chromatic hypergraphs with few edges

DOI10.1016/J.JCTA.2013.04.007MaRDI QIDQ2349182zbMATH OpenOpenAlexFDO

Authors 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

constructive boundextremal problemhypergraphproperty B

Mathematics Subject Classification ID

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

Recommendations

• On r-chromatic hypergraphs
• On the Erdős-Hajnal problem for 3-uniform hypergraphs
• A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2
• Lower bounds for the number of edges in hypergraphs of certain classes
• On the construction of non-2-colorable uniform hypergraphs

Cited in

(15)

• A note on panchromatic colorings
• Chain method for panchromatic colorings of hypergraphs
• \((2, 2)\)-colourings and clique-free \(\sigma\)-hypergraphs
• The minimum chromatic spectrum of 3-uniform \(\mathcal{C}\)-hypergraphs
• A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2
• On the construction of non-2-colorable uniform hypergraphs
• A note on two-colorability of nonuniform hypergraphs
• A general framework for hypergraph coloring
• Improved Bounds for Uniform Hypergraphs without Property B
• Extremal problems in hypergraph colourings
• The intersection spectrum of 3‐chromatic intersecting hypergraphs
• The intersection spectrum of 3-chromatic intersecting hypergraphs
• Improving Gebauer's construction of 3-chromatic hypergraphs with few edges
• Chip games and paintability
• Selective hypergraph colourings

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2349182)