REVIEW 1 cited by
Radon numbers and the fractional Helly theorem
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
A basic measure of the combinatorial complexity of a convexity space is its Radon number. In this paper we show a fractional Helly theorem for convexity spaces with a bounded Radon number, answering a question of Kalai. As a consequence we also get a weak epsilon-net theorem for convexity spaces with a bounded Radon number. This answers a question of Bukh and extends a recent result of Moran and Yehudayoff.
Forward citations
Cited by 1 Pith paper
-
Bounding Radon numbers via Betti numbers
Bounding low-degree Betti numbers of all intersections of a set family bounds its Radon number, giving an optimal surface fractional Helly theorem for b=0.
Discussion (0). Continue with ORCID to comment.