Extremal problems for colourings of uniform hypergraphs
From MaRDI portal
Publication:5451060
DOI10.1070/IM2007v071n06ABEH002388zbMath1247.05116OpenAlexW2022556973MaRDI 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
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Extremal set theory (05D05) Coloring of graphs and hypergraphs (05C15)
Related Items (9)
On algorithmic methods of analysis of two-colorings of hypergraphs ⋮ On some generalizations of the property B problem of an \(n\)-uniform hypergraph ⋮ Random constructions of hypergraphs with large girth and without panchromatic colorings ⋮ 2-colorings of hypergraphs with large girth ⋮ Extremal problems in hypergraph colourings ⋮ Upper bound in the Erdős-Hajnal problem of hypergraph coloring ⋮ On a generalization of Rubin's theorem ⋮ On balanced colorings of hypergraphs ⋮ New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\)
This page was built for publication: Extremal problems for colourings of uniform hypergraphs