On the construction of non-2-colorable uniform hypergraphs

DOI10.1016/J.DAM.2014.08.011zbMath1303.05132arXiv1308.5766OpenAlexW2065201808MaRDI QIDQ476325

Jithin Mathews, Saswata Shannigrahi, Manas Kumar Panda

Publication date: 28 November 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

uniform hypergraphhypergraph coloringproperty B

Mathematics Subject Classification ID

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

Related Items (2)

Extremal problems in hypergraph colourings ⋮ Improved Bounds for Uniform Hypergraphs without Property B

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On 3-chromatic hypergraphs
• On the construction of 3-chromatic hypergraphs with few edges
• On the minimum size of 4-uniform hypergraphs without property \(B\)
• A Note on a Combinatorial Problem of ErdŐS and Hajnal
• Improved bounds and algorithms for hypergraph 2-coloring
• On a Combinatorial Problem of Erdös and Hajnal
• On A Combinatorial Problem of Erdös
• On a combinatorial problem. II

This page was built for publication: On the construction of non-2-colorable uniform hypergraphs