Extremal problems for colorings of simple hypergraphs and applications

DOI10.1016/J.ENDM.2015.06.062zbMath1346.05077OpenAlexW2176155952MaRDI QIDQ322292

Jakub Kozik, Dmitriy A. Shabanov

Publication date: 14 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.06.062

zbMATH Keywords

colorings of hypergraphssimple hypergraphsVan der Waerden numbers

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• On the chromatic number of simple triangle-free triple systems
• Coloring uniform hypergraphs with few edges
• An application of Lovász' local lemma-A new lower bound for the van der Waerden number
• A note on random greedy coloring of uniform hypergraphs
• Multipass greedy coloring of simple uniform hypergraphs
• Improved bounds and algorithms for hypergraph 2-coloring

This page was built for publication: Extremal problems for colorings of simple hypergraphs and applications