Attempting perfect hypergraphs

DOI10.1007/s11856-023-2506-8zbMath1526.05057arXiv2111.03228OpenAlexW3212141882MaRDI QIDQ6076187

Maria Chudnovsky, Gil Kalai

Publication date: 23 October 2023

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

hypergraphsperfect graphscoloringperfect hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Perfect graphs (05C17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Projectivities in simplicial complexes and colorings of simple polytopes
• Über eine Variante zum Hellyschen Satz
• Entropy splitting for antiblocking corners and perfect graphs
• The strong perfect graph theorem
• A short proof of the existence of highly chromatic hypergraphs without short cycles
• Coloring mixed hypergraphs: theory, algorithms and applications
• Transversal numbers for hypergraphs arising in geometry
• Entropy splitting hypergraphs
• Minimal imperfect graphs: A simple approach
• Toric chordality
• Normal hypergraphs and the perfect graph conjecture
• Higher chordality: From graphs to complexes
• C-perfect hypergraphs
• Even Triangulations of S 3 and the Coloring of Graphs
• A survey of χ‐boundedness

This page was built for publication: Attempting perfect hypergraphs