Diversity

11/02/2018
by   Peter Frankl, et al.
0

Given a family F⊂ 2^[n], its diversity is the number of sets not containing an element with the highest degree. The concept of diversity has proven to be very useful in the context of k-uniform intersecting families. In this paper, we study (different notions of) diversity in the context of other extremal set theory problems. One of the main results of the paper is a sharp stability result for cross-intersecting families in terms of diversity and, slightly more generally, sharp stability for the Kruskal--Katona theorem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/08/2017

Diversity of uniform intersecting families

A family f⊂ 2^[n] is called intersecting, if any two of its sets inter...
research
10/06/2017

Structure and properties of large intersecting families

We say that a family of k-subsets of an n-element set is intersecting, i...
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
10/01/2018

Degree versions of theorems on intersecting families via stability

The matching number of a family of subsets of an n-element set is the ma...
research
05/20/2019

Sharp results concerning disjoint cross-intersecting families

For an $n$-element set $X$ let $\binom{X}{k}$ be the collection of all i...
research
08/29/2018

Asymmetry of copulas arising from shock models

When choosing the right copula for our data a key point is to distinguis...
research
05/09/2022

Repeated Averages on Graphs

Sourav Chatterjee, Persi Diaconis, Allan Sly and Lingfu Zhang, prompted ...

Please sign up or login with your details

Forgot password? Click here to reset