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

DOI10.1134/S1064562409030132zbMATH Open1281.05099OpenAlexW2018064035MaRDI QIDQ736013FDOQ736013

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

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (9)

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

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)