P. Frankl

activity

20112026

s

pairwise disjoint sets

15 citations · 86 across the 50 of their papers we have counts for

collaborators

Showing 2019Show all

4 papers · 1 filter

math.CO2019

Sharp results concerning disjoint cross-intersecting families

Peter Frankl, Andrey Kupavskii

For an $n$ -element set $X$ let $(k X)$ be the collection of all its $k$ -subsets. Two families of sets $A$ and $B$ are called cross-intersecting if $A\cap B…

math.CO2019

Extremal set theory for the binomial norm

Peter Frankl

Best possible bounds are established for families without s pairwise disjoint members and the more general problem for several families. The results are shown to apply several clas…

math.CO2019

Beyond the Erdős Matching Conjecture

Peter Frankl, Andrey Kupavskii

A family $F \subset (k [ n ])$ is $U (s, q)$ of for any $F_{1}, \dots, F_{s} \in F$ we have $∣ F_{1} \cup \dots \cup F_{s} ∣ \leq q$ . This notion generalizes the property of a…

math.CO2019★ 12 cited

Simple juntas for shifted families

Peter Frankl, Andrey Kupavskii

We say that a family $F$ of $k$ -element sets is a {\it $j$ -junta} if there is a set $J$ of size $j$ such that, for any $F$ , its presence in $F$ depends on its int…