The colorful Helly theorem and general hypergraphs
From MaRDI portal
(Redirected from Publication:412268)
Recommendations
Cites work
- scientific article; zbMATH DE number 3508549 (Why is no real title available?)
- scientific article; zbMATH DE number 3338381 (Why is no real title available?)
- A generalization of Caratheodory's theorem
- Colourful Linear Programming and its Relatives
- Complexity aspects of generalized Helly hypergraphs
- Complexity aspects of the Helly property: graphs and hypergraphs
- Degrees of acyclicity for hypergraphs and relational database schemes
- Ensemble convexes dans les graphes. I: Théoremes de Helly et de Radon pour graphes et surfaces
- Helly property in finite set systems
- Hypergraph imaging: An overview
- Improved algorithms for recognizing \(p\)-Helly and hereditary \(p\)-Helly hypergraphs
- The colorful Helly property for hypergraphs
Cited in
(12)- A topological colorful Helly theorem
- THE HANF NUMBER FOR AMALGAMATION OF COLORING CLASSES
- Helly-type theorems for the ordering of the vertices of a hypergraph
- The colorful Helly property for hypergraphs
- Helly numbers of polyominoes
- Van der Waerden function and colorings of hypergraphs with large girth
- Häggkvist-Hell graphs: A class of Kneser-colorable graphs
- scientific article; zbMATH DE number 15373 (Why is no real title available?)
- Complexity aspects of the Helly property: graphs and hypergraphs
- Helly-type theorems for appropriate colorings of visibility sets
- Colorings of hypermaps and a conjecture of Brenner and Lyndon
- scientific article; zbMATH DE number 3843775 (Why is no real title available?)
This page was built for publication: The colorful Helly theorem and general hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412268)