Coloring non-uniform hypergraphs without short cycles
From MaRDI portal
Publication:742641
DOI10.1007/s00373-013-1333-9zbMath1298.05134OpenAlexW2008743411MaRDI QIDQ742641
Publication date: 19 September 2014
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-013-1333-9
Hypergraphs (05C65) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items
Equitable colorings of non-uniform simple hypergraphs, Equitable colorings of nonuniform hypergraphs, On some generalizations of the property B problem of an \(n\)-uniform hypergraph, Extremal problems in hypergraph colourings, Around Erdős-Lovász problem on colorings of non-uniform hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On \(r\)-chromatic hypergraphs
- Improvement of the lower bound in the Erdös-Hajnal combinatorial problem
- On the chromatic number of finite systems of subsets
- Hypergraphs with high chromatic number
- On 3-chromatic hypergraphs
- Coloring n-sets red and blue
- On a combinatorial problem of P. Erdős and L. Lovasz
- Greedy colorings of uniform hypergraphs
- Coloring uniform hypergraphs with few colors
- Improved bounds and algorithms for hypergraph 2-coloring
- On a property of families of sets
- On a combinatorial problem. II