Lower bounds for the number of edges in hypergraphs of certain classes
From MaRDI portal
Publication:630232
DOI10.1134/S1064562410050078zbMath1273.05158OpenAlexW1983293242MaRDI QIDQ630232
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
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42)
Cites Work
- Improvement of the lower bound in the Erdös-Hajnal combinatorial problem
- On the chromatic number of finite systems of subsets
- On 3-chromatic hypergraphs
- Coloring n-sets red and blue
- On the chromatic number of set systems
- Coloring uniform hypergraphs with few edges
- Coloring H-free hypergraphs
- Coloring uniform hypergraphs with few colors
- Improved bounds and algorithms for hypergraph 2-coloring
This page was built for publication: Lower bounds for the number of edges in hypergraphs of certain classes
