Extremal problems for colourings of uniform hypergraphs

DOI10.1070/IM2007V071N06ABEH002388MaRDI QIDQ5451060zbMATH OpenOpenAlexFDO

Authors D. A. Shabanov

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

zbMATH Keywords

extremal theory of hypergraphspolychromatic colourings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Hypergraphs (05C65) Random graphs (graph-theoretic aspects) (05C80) 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

(27)

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

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)