Lower bounds for the number of edges in hypergraphs of certain classes

DOI10.1134/S1064562410050078zbMATH Open1273.05158OpenAlexW1983293242MaRDI QIDQ630232FDOQ630232

D. A. Shabanov

Publication date: 17 March 2011

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

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

Recommendations

• Improvement of the lower bound in the Erdös-Hajnal combinatorial problem
• On \(r\)-chromatic hypergraphs
• On the Erdős-Hajnal problem for 3-uniform hypergraphs
• Colorings of hypergraphs with large number of colors
• Colorings of hypergraphs with large number of colors

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30) Density (toughness, etc.) (05C42) Hypergraphs (05C65)

Cites Work

• Coloring uniform hypergraphs with few edges
• Coloring H-free hypergraphs
• Improved bounds and algorithms for hypergraph 2-coloring
• On 3-chromatic hypergraphs
• Improvement of the lower bound in the Erdös-Hajnal combinatorial problem
• Coloring n-sets red and blue
• On the chromatic number of set systems
• On the chromatic number of finite systems of subsets
• Coloring uniform hypergraphs with few colors

Cited In (3)

• Bounds on the number of edges in hypertrees
• Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs
• An upper bound on the number of edges of a hypergraph with a given diameter

This page was built for publication: Lower bounds for the number of edges in hypergraphs of certain classes

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