P. Frankl

activity

20112026

s

pairwise disjoint sets

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

collaborators

Showing 2021Show all

9 papers · 1 filter

cs.CC2021

A Variant of the VC-dimension with Applications to Depth-3 Circuits

Peter Frankl, Svyatoslav Gryaznov, Navid Talebanfard

We introduce the following variant of the VC-dimension. Given $S \subseteq {0, 1}^{n}$ and a positive integer $d$ , we define $U_{d} (S)$ to be the size of the largest subset…

math.CO2021

Piercing the chessboard

Gergely Ambrus, Imre Bárány, Péter Frankl +1

We consider the minimum number of lines $h_{n}$ and $p_{n}$ needed to intersect or pierce, respectively, all the cells of the $n \times n$ chessboard. Determining these values can also…

math.CO2021

On the maximum number of distinct intersections in an intersecting family

Peter Frankl, Sergei Kiselev, Andrey Kupavskii

For $n > 2 k \geq 4$ we consider intersecting families $F$ consisting of $k$ -subsets of ${1, 2, \dots, n}$ . Let $I (F)$ denote the family of all distinc…

math.CO2021

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

Peter Frankl, Sergei Kiselev, Andrey Kupavskii

For a family $F$ , let $D (F)$ stand for the family of all sets that can be expressed as $F ∖ G$ , where $F, G \in F$ . A family $F$ i…

math.CO2021

Uniform intersecting families with large covering number

Peter Frankl, Andrey Kupavskii

A family $F$ has covering number $τ$ if the size of the smallest set intersecting all sets from $F$ is equal to $τ$ . Let $M (n, k, τ)$ stand for the size of the larg…

math.CO2021

On the sum of sizes of overlapping families

Peter Frankl, Jian Wang

Let $A_{1}, \dots, A_{m}$ be families of $k$ -subsets of an $n$ -set. Suppose that one cannot choose pairwise disjoint edges from $s + 1$ distinct families. Subject to t…