An inductive proof of the Bollob\'{a}s two family theorem
Sayan Goswami
TL;DR
This paper presents an inductive proof of the Bollobás two family theorem, offering a new approach inspired by Frankl's inductive proof of the LYM-inequality, contributing to combinatorial theory.
Contribution
It introduces an inductive proof method for the Bollobás two family theorem, expanding the toolkit for combinatorial proofs.
Findings
Provides an alternative inductive proof of the Bollobás two family theorem
Enhances understanding of combinatorial inequalities
Connects proof techniques between LYM-inequality and Bollobás theorem
Abstract
Inspired by the inductive proof of LYM-inequality given by P. Frankl, we provide an inductive proof of the Bollob\'{a}s two family theorem.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematics and Applications · Analytic Number Theory Research · Point processes and geometric inequalities