The colorful Helly theorem and general hypergraphs

DOI10.1016/j.ejc.2011.09.029zbMath1237.05140OpenAlexW1993532535MaRDI QIDQ412268

Mitre C. Dourado, Rommel M. Barbosa, Erika M. M. Coelho, Jayme Luiz Szwarcfiter

Publication date: 4 May 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2011.09.029

zbMATH Keywords

colorful Helly propertyHelly property for hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Convex sets without dimension restrictions (aspects of convex geometry) (52A05)

Related Items (1)

Helly numbers of polyominoes

Cites Work

• Unnamed Item
• Unnamed Item
• Complexity aspects of generalized Helly hypergraphs
• Improved algorithms for recognizing \(p\)-Helly and hereditary \(p\)-Helly hypergraphs
• Ensemble convexes dans les graphes. I: Théoremes de Helly et de Radon pour graphes et surfaces
• A generalization of Caratheodory's theorem
• Helly property in finite set systems
• Complexity aspects of the Helly property: graphs and hypergraphs
• The Colorful Helly Property for Hypergraphs
• Degrees of acyclicity for hypergraphs and relational database schemes
• Colourful Linear Programming and its Relatives
• Hypergraph imaging: An overview

This page was built for publication: The colorful Helly theorem and general hypergraphs