On the construction of non-2-colorable uniform hypergraphs

DOI10.1016/J.DAM.2014.08.011MaRDI QIDQ476325zbMATH OpenOpenAlexFDO

Authors Jithin Mathews, Manas Kumar Panda, Saswata Shannigrahi

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

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

Abstract: The problem of 2-coloring uniform hypergraphs has been extensively studied over the last few decades. An n-uniform hypergraph is not 2-colorable if its vertices can't be colored with two colors, Red and Blue, such that every hyperedge contains Red as well as Blue vertices. The least possible number of hyperedges in an n-uniform hypergraph which is not 2-colorable is denoted by m(n). In this paper, we consider the problem of finding an upper bound on m(n) for small values of n. We provide constructions which improve the existing results for some such values of n. We obtain the first improvement in the case of n=8.

Recommendations

• Improved Bounds for Uniform Hypergraphs without Property B
• On algorithmic methods of analysis of two-colorings of hypergraphs
• On balanced colorings of hypergraphs
• 2-colorings of uniform hypergraphs
• Around Erdős-Lovász problem on colorings of non-uniform hypergraphs

Cites work

• scientific article; zbMATH DE number 3685495 (Why is no real title available?)
• scientific article; zbMATH DE number 11977 (Why is no real title available?)
• scientific article; zbMATH DE number 3485832 (Why is no real title available?)
• scientific article; zbMATH DE number 821271 (Why is no real title available?)
• scientific article; zbMATH DE number 918337 (Why is no real title available?)
• scientific article; zbMATH DE number 3188524 (Why is no real title available?)
• A Note on a Combinatorial Problem of ErdŐS and Hajnal
• Improved bounds and algorithms for hypergraph 2-coloring
• On 3-chromatic hypergraphs
• On A Combinatorial Problem of Erdös
• On a Combinatorial Problem of Erdös and Hajnal
• On a combinatorial problem. II
• On the construction of 3-chromatic hypergraphs with few edges
• On the minimum size of 4-uniform hypergraphs without property \(B\)

Cited in

(6)

• On the construction of 3-chromatic hypergraphs with few edges
• On algorithmic methods of analysis of two-colorings of hypergraphs
• On balanced colorings of hypergraphs
• Extremal problems in hypergraph colourings
• Improved Bounds for Uniform Hypergraphs without Property B
• The existence of uniform hypergraphs for which the interpolation property of complete coloring fails

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

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