On Max-Clique for intersection graphs of sets and the Hadwiger-Debrunner numbers

DOI10.1137/1.9781611974782.148zbMath1417.52007OpenAlexW4237451579MaRDI QIDQ4575896

Chaya Keller, Gábor Tardos, Shakhar Smorodinsky

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611974782.148

zbMATH Keywords

Hadwiger-Debrunner conjectureintersection graphs of convex sets

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Helly-type theorems and geometric transversal theory (52A35)

Related Items (12)

Journey to the Center of the Point Set ⋮ Bounds on piercing and line-piercing numbers in families of convex sets in the plane ⋮ On a problem of Danzer ⋮ Unnamed Item ⋮ From a $(p,2)$-Theorem to a Tight $(p,q)$-Theorem ⋮ Planar point sets determine many pairwise crossing segments ⋮ Unnamed Item ⋮ A new lower bound on Hadwiger-Debrunner numbers in the plane ⋮ On a Problem of Danzer ⋮ The (2,2) and (4,3) Properties in Families of Fat Sets in the Plane ⋮ On the chromatic number of disjointness graphs of curves ⋮ Piercing numbers in approval voting

This page was built for publication: On Max-Clique for intersection graphs of sets and the Hadwiger-Debrunner numbers