A short proof of a conjecture of De Remer and Pennello
Abstract
References
Index Terms
- A short proof of a conjecture of De Remer and Pennello
Recommendations
Proof of a Conjecture of Bárány, Katchalski and Pach
Bárány, Katchalski and Pach (Proc Am Math Soc 86(1):109---114, 1982) (see also Bárány et al., Am Math Mon 91(6):362---365, 1984) proved the following quantitative form of Helly's theorem. If the intersection of a family of convex sets in $$\mathbb {R}^d$...
Short proof of two cases of Chvátal’s conjecture
AbstractIn 1974 Chvátal conjectured that no intersecting family F in a downset can be larger than the largest star. In the same year Kleitman and Magnanti proved the conjecture when F is contained in the union of two stars, and Sterboul when ...
A new short proof of a theorem of Ahlswede and Khachatrian
Ahlswede and Khachatrian [R. Ahlswede, L.H. Khachatrian, The complete nontrivial-intersection theorem for systems of finite sets, J. Combin. Theory Ser. A 76 (1996) 121-138] proved the following theorem, which answered a question of Frankl and Furedi [...
Comments
Information & Contributors
Information
Published In
![cover image ACM Transactions on Programming Languages and Systems](/cms/asset/b64712b0-04aa-4239-94e3-a256a0a7e262/default_cover.png)
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 262Total Downloads
- Downloads (Last 12 months)22
- Downloads (Last 6 weeks)7
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in