Diversity of uniform intersecting families

09/08/2017
by   Andrey Kupavskii, et al.
0

A family f⊂ 2^[n] is called intersecting, if any two of its sets intersect. Given an intersecting family, its diversity is the number of sets not passing through the most popular element of the ground set. Frankl made the following conjecture: for n> 3k>0 any intersecting family f⊂[n] k has diversity at most n-3 k-2. This is tight for the following "two out of three" family: {F∈[n] k: |F∩ [3]|> 2}. In this note we prove this conjecture for n> ck, where c is a constant independent of n and k.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/09/2021

Best possible bounds on the number of distinct differences in intersecting families

For a family ℱ, let 𝒟(ℱ) stand for the family of all sets that can be ex...
research
11/02/2018

Diversity

Given a family F⊂ 2^[n], its diversity is the number of sets not contai...
research
03/06/2019

Characterizing 3-sets in Union-Closed Families

A family of sets is union-closed (UC) if the union of any two sets in th...
research
09/20/2020

Note on Sunflowers

A sunflower with p petals consists of p sets whose pairwise intersection...
research
02/23/2019

Fully Automatic, Verified Classification of all Frankl-Complete (FC(6)) Set Families

The Frankl's conjecture, formulated in 1979. and still open, states that...
research
06/26/2022

On the Impossibility of Decomposing Binary Matroids

We show that there exist k-colorable matroids that are not (b,c)-decompo...
research
01/26/2019

Beyond the Erdős Matching Conjecture

A family F⊂[n] k is U(s,q) of for any F_1,..., F_s∈ F we have |F_1∪...∪...

Please sign up or login with your details

Forgot password? Click here to reset