Improved Bounds for Uniform Hypergraphs without Property B

zbMath1439.05168arXiv1602.00218MaRDI QIDQ5109054

Shwetank Singh, Sachin Aglave, Saswata Shannigrahi, V. A. Amarnath

Publication date: 7 May 2020

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

zbMATH Keywords

properly 2-colorable hypergraphs

Mathematics Subject Classification ID

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

Related Items (1)

Extremal problems in hypergraph colourings

Cites Work

• On the construction of non-2-colorable uniform hypergraphs
• 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 random greedy coloring of uniform hypergraphs
• 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 III
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Improved Bounds for Uniform Hypergraphs without Property B