We give a simple linear algebraic proof of the following conjecture of Frankl and Fu redi [7,9,13]. (Frankl We generalise a method of Palisse and our proof-technique can be viewed as a variant of the technique used by Tverberg to prove a result of Graham and Pollak [10,11,14]. Our proof-technique
On a Conjecture of Frankl and Füredi
✍ Scribed by Ameera Chowdhury
- Book ID
- 119236565
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 177 KB
- Volume
- 38
- Category
- Article
- ISSN
- 1571-0653
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Frankl and Fu redi conjectured that given a family F of subsets of [n] such that 1 |E & F| k for all distinct E and F in F, we must have |F| k i=0 ( n&1 i
It is possible to find II partitions of an n-element set whose pairwise intersections are just all atoms of the partition lattice? Demetrovics, Ftiredi and Katona verified this for all n -1 or 4 (mod 12) by constructing a series of special Mendelsohn Triple Systems. They conjectured that such tripl
## Abstract An induced subgraph ${\cal S}$ of a graph ${\cal G}$ is called a derived subgraph of ${\cal G}$ if ${\cal S}$ contains no isolated vertices. An edge __e__ of ${\cal S}$ is said to be residual if __e__ occurs in more than half of the derived subgraphs of ${\cal S}$. In this article, we p