Extremal problems for colourings of uniform hypergraphs

DOI10.1070/IM2007V071N06ABEH002388MaRDI QIDQ5451060zbMATH OpenOpenAlexFDO

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 theory of hypergraphs polychromatic colourings

Random graphs (graph-theoretic aspects) (05C80) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Extremal set theory (05D05)

Recommendations

On some generalizations of the property B problem of an \(n\)-uniform hypergraph
Randomized algorithms for colourings of hypergraphs
On the vertex number of almost bipartite hypergraphs
Combinatorial extremum problems for 2-colorings of hypergraphs
Extremal problems in hypergraph colourings

Cited in

(26)

Combinatorial extremum problems for 2-colorings of hypergraphs
On the minimum size of 4-uniform hypergraphs without property \(B\)
On a generalization of Rubin's theorem
Extremal problems for panchromatic colourings of uniform hypergraphs
Multicoloured extremal problems
Randomized algorithms for colourings of hypergraphs
On algorithmic methods of analysis of two-colorings of hypergraphs
2-colorings of hypergraphs with large girth
Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs
On balanced colorings of hypergraphs
Extremal problems in hypergraph colourings
On a 3-uniform hypergraph coloring problem in the integers
Upper bound in the Erdős-Hajnal problem of hypergraph coloring
Coloring four-uniform hypergraphs on nine vertices
scientific article; zbMATH DE number 4047752 (Why is no real title available?)
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 the vertex number of almost bipartite hypergraphs
The existence of uniform hypergraphs for which the interpolation property of complete coloring fails
On Some Extremal Properties of Hypergraph Colorings
2-colorings of uniform hypergraphs
New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\)
Extremal \(n\)-systems of sets
scientific article; zbMATH DE number 4183438 (Why is no real title available?)
On rainbow-free colourings of uniform hypergraphs
Universal limit theorems in graph coloring problems with connections to extremal combinatorics

This page was built for publication: Extremal problems for colourings of uniform hypergraphs

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