Kneser Colorings of Uniform Hypergraphs

DOI10.1016/j.endm.2009.07.036zbMath1273.05070OpenAlexW2075026166MaRDI QIDQ2851466

Carlos Hoppen, Hanno Lefmann, Yoshiharu Kohayakawa

Publication date: 10 October 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

extremal combinatoricsTurán numberintersecting systems of sets

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items

Stability for the Erdős-Rothschild problem ⋮ On the maximum number of integer colourings with forbidden monochromatic sums ⋮ The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques

Cites Work

• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On Colourings of Hypergraphs Without Monochromatic Fano Planes
• THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
• Unnamed Item
• Unnamed Item