An Unstable Hypergraph Problem with a Unique Optimal Solution

DOI10.1007/978-3-642-36899-8_20zbMath1378.05147OpenAlexW44801928MaRDI QIDQ4915249

Yoshiharu Kohayakawa, Hanno Lefmann, Carlos Hoppen

Publication date: 9 April 2013

Published in: Information Theory, Combinatorics, and Search Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36899-8_20

zbMATH Keywords

hypergraphscoloringsstability theorem

Mathematics Subject Classification ID

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

Related Items (3)

Hypergraphs with many Kneser colorings ⋮ Colourings without monochromatic disjoint pairs ⋮ A coloring problem for intersecting vector spaces

Cites Work

• Unnamed Item
• Unnamed Item
• On \(q\)-analogues and stability theorems
• Hypergraphs with many Kneser colorings
• Set systems without a simplex or a cluster
• The complete intersection theorem for systems of finite sets
• More constructions for Turan's (3,4)-conjecture
• A class of constructions for Turan's (3,4)-problem
• The Turán number of the Fano plane
• Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Triple Systems Not Containing a Fano Configuration

This page was built for publication: An Unstable Hypergraph Problem with a Unique Optimal Solution