An unstable hypergraph problem with a unique optimal solution

DOI10.1007/978-3-642-36899-8_20zbMATH Open1378.05147OpenAlexW44801928MaRDI QIDQ4915249FDOQ4915249

Authors: Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann 

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

Recommendations

• Stability of extremal hypergraphs with applications to an edge-coloring problem
• A coloring problem for intersecting vector spaces
• A unified approach to hypergraph stability
• scientific article; zbMATH DE number 3898934
• Hypergraphs with many Kneser colorings

zbMATH Keywords

hypergraphscoloringsstability theorem

Mathematics Subject Classification ID

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

Cites Work

• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• The complete intersection theorem for systems of finite sets
• Set systems without a simplex or a cluster
• The Turán number of the Fano plane
• Triple Systems Not Containing a Fano Configuration
• On \(q\)-analogues and stability theorems
• Edge colourings of graphs avoiding monochromatic matchings of a given size
• Hypergraphs with many Kneser colorings
• Title not available (Why is that?)
• A class of constructions for Turan's (3,4)-problem
• Title not available (Why is that?)
• More constructions for Turan's (3,4)-conjecture

Cited In (3)

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

This page was built for publication: An unstable hypergraph problem with a unique optimal solution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4915249)