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

DOI10.1134/S1064562409030132MaRDI QIDQ736013zbMATH OpenOpenAlexFDO

Authors D. 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

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

Recommendations

• Lower bounds for the number of edges in hypergraphs of certain classes
• On \(r\)-chromatic hypergraphs
• On the Erdős-Hajnal problem for 3-uniform hypergraphs
• On the Erdős-Hajnal problem for 3-graphs
• Colorings of hypergraphs with large number of colors

Cites work

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

Cited in

(10)

• Extremal problems in hypergraph colourings
• Erdős-Hajnal problem for \(H\)-free hypergraphs
• scientific article; zbMATH DE number 6169011 (Why is no real title available?)
• On \(r\)-chromatic hypergraphs
• Improved bounds for Erdős' matching conjecture
• On a Problem of Erdos and Lovasz. II: n(r) = O(r)
• Lower bounds for the number of edges in hypergraphs of certain classes
• Coloring non-uniform hypergraphs without short cycles
• Random coloring method in the combinatorial problem of Erdős and Lovász
• On two-colorings of hypergraphs

This page was built for publication: Improvement of the lower bound in the Erdös-Hajnal combinatorial problem

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