Improvement of the lower bound in the Erdös-Hajnal combinatorial problem

DOI10.1134/S1064562409030132zbMath1281.05099OpenAlexW2018064035MaRDI QIDQ736013

Dmitriy A. Shabanov

Publication date: 26 October 2009

Published in: Doklady Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064562409030132

Mathematics Subject Classification ID

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

Related Items

Extremal problems in hypergraph colourings ⋮ Lower bounds for the number of edges in hypergraphs of certain classes ⋮ On two-colorings of hypergraphs ⋮ On \(r\)-chromatic hypergraphs ⋮ Coloring non-uniform hypergraphs without short cycles ⋮ Random coloring method in the combinatorial problem of Erdős and Lovász

Cites Work

• Hypergraphs with high chromatic number
• On 3-chromatic hypergraphs
• On a combinatorial problem of P. Erdős and L. Lovasz
• Coloring uniform hypergraphs with few colors
• Improved bounds and algorithms for hypergraph 2-coloring
• Ein kombinatorisches Problem von P. Erdős und A. Hajnal
• On a property of families of sets
• On a combinatorial problem. II