On the chromatic number of simple triangle-free triple systems

DOI10.1134/S106456241202024XzbMath1165.05324arXiv0809.2979MaRDI QIDQ1010856

Dhruv Mubayi, Alan M. Frieze, Andrey B. Kupavskii, Dmitriy A. Shabanov

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics, Doklady Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0809.2979

zbMATH Keywords

hypergraphchromatic numbertriangle free triple systemuniform hypergraph coloring

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Triple systems (05B07) Extremal combinatorics (05D99)

Related Items (10)

List coloring triangle-free hypergraphs ⋮ Extremal problems for colorings of simple hypergraphs and applications ⋮ Colouring Non-sparse Random Intersection Graphs ⋮ Van der Waerden function and colorings of hypergraphs with large girth ⋮ Bounds on Ramsey games via alterations ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ Defective coloring of hypergraphs ⋮ Sparse hypergraphs with low independence number ⋮ On independent sets in hypergraphs ⋮ A note on a problem of Erdős on right angles

Cites Work

• Lower bounds in the combinatorial problem of Erdős and Lovász
• On \(r\)-chromatic hypergraphs
• On 3-chromatic hypergraphs
• Coloring n-sets red and blue
• Coloring H-free hypergraphs
• Constructions of sparse uniform hypergraphs with high chromatic number
• An application of Lovász' local lemma-A new lower bound for the van der Waerden number
• Coloring uniform hypergraphs with few colors
• On Brooks' Theorem for Sparse Graphs
• Improved bounds and algorithms for hypergraph 2-coloring

This page was built for publication: On the chromatic number of simple triangle-free triple systems