Extremal problems for colourings of uniform hypergraphs
From MaRDI portal
Publication:5451060
DOI10.1070/IM2007v071n06ABEH002388zbMath1247.05116MaRDI QIDQ5451060
Publication date: 18 March 2008
Published in: Izvestiya: Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1070/im2007v071n06abeh002388
05C35: Extremal problems in graph theory
05C80: Random graphs (graph-theoretic aspects)
05C65: Hypergraphs
05D05: Extremal set theory
05C15: Coloring of graphs and hypergraphs
Related Items
Extremal problems in hypergraph colourings, On algorithmic methods of analysis of two-colorings of hypergraphs, On balanced colorings of hypergraphs, Upper bound in the Erdős-Hajnal problem of hypergraph coloring, New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\), 2-colorings of hypergraphs with large girth, On some generalizations of the property B problem of an \(n\)-uniform hypergraph, Random constructions of hypergraphs with large girth and without panchromatic colorings, On a generalization of Rubin's theorem