A new lower bound on Hadwiger-Debrunner numbers in the plane
From MaRDI portal
Publication:6621229
Chaya Keller, Shakhar Smorodinsky
Publication date: 18 October 2024
Published in: Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)
Other problems of combinatorial convexity (52A37) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hypergraph containers
- Lower bounds for weak epsilon-nets and stair-convexity
- Über eine Variante zum Hellyschen Satz
- On some metric and combinatorial geometric problems
- \(\epsilon\)-nets and simplex range queries
- Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem
- Improved bounds on the Hadwiger-Debrunner numbers
- Voting in Agreeable Societies
- Maximal Independent Subsets in Steiner Systems and in Planar Sets
- Point Selections and Weak ε-Nets for Convex Hulls
- On the number of points in general position in the plane
- Externally definable sets and dependent pairs II
- Independent sets in hypergraphs
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Convex sets in the plane with three of every four meeting
This page was built for publication: A new lower bound on Hadwiger-Debrunner numbers in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6621229)
