On a problem of Danzer

DOI10.1017/S0963548318000445zbMATH Open1436.52020OpenAlexW2896317695MaRDI QIDQ5222544FDOQ5222544

Authors: Nabil H. Mustafa, Saurabh Ray 

Publication date: 6 April 2020

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548318000445

Recommendations

• Improved bounds on the Hadwiger-Debrunner numbers
• A new lower bound on Hadwiger-Debrunner numbers in the plane
• A purely combinatorial proof of the Hadwiger Debrunner \((p,q)\) conjecture
• Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem
• Bounding the piercing number

zbMATH Keywords

polynomial boundHadwiger-Debrunner number

Mathematics Subject Classification ID

Combinatorial complexity of geometric structures (52C45)

Cites Work

• Applications of random sampling in computational geometry. II
• Weak \(\varepsilon \)-nets have basis of size \(O(1/\varepsilon\log (1/\varepsilon))\) in any dimension
• Title not available (Why is that?)
• Title not available (Why is that?)
• Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• \(k\)-sets and \(k\)-facets
• On Max-Clique for intersection graphs of sets and the Hadwiger-Debrunner numbers
• On Center Regions and Balls Containing Many Points
• An optimal generalization of the colorful Carathéodory theorem
• Über Durchschnittseigenschaften n-dimensionaler Kugelfamilien.
• Improved bounds on the Hadwiger-Debrunner numbers
• Near-Optimal Lower Bounds for ε-Nets for Half-Spaces and Low Complexity Set Systems
• A simple proof of optimal epsilon nets

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: On a problem of Danzer

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