P. Frankl

activity

20112026

s

pairwise disjoint sets

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

collaborators

63 papers

math.CO2026

Intersecting families with covering number three II

Peter Frankl, Jian Wang

A family $F \subset (k [ n ])$ is called intersecting if $F \cap F^{'} \neq = \emptyset$ for all $F, F^{'} \in F$ . The covering number of a family $F$ is defi…

math.CO2023

Odd-Sunflowers

Peter Frankl, János Pach, Dömötör Pálvölgyi

Extending the notion of sunflowers, we call a family of at least two sets an odd-sunflower if every element of the underlying set is contained in an odd number of sets or in none o…

math.CO2023

On the $C$ -diversity of intersecting hypergraphs

Peter Frankl, Jian Wang

Let $F \subset (k X)$ be a family consisting of $k$ -subsets of the $n$ -set $X$ . Suppose that $F$ is intersecting, i.e., $F \cap F^{'} \neq = \emptyset$ for all $…

math.CO2023

Variations on the Bollobás set-pair theorem

Gábor Hegedüs, Péter Frankl

Let $X$ be an $n$ -element set. A set-pair system $\mbox{$\cal P$}=\{(A_i,B_i)\}_{1\leq i\leq m}$ is a collection of pairs of disjoint subsets of $X$ . It is called skew Bollobás sys…

math.CO2023

Improved bounds on the maximum diversity of intersecting families

Peter Frankl, Jian Wang

A family $F \subset (k [ n ])$ is called an intersecting family if $F \cap F^{'} \neq = \emptyset$ for all $F, F^{'} \in F$ . If $\cap F \neq = \emptyset$ then $\…

math.CO2023

On asymptotic local Turán problems

Peter Frankl, Jiaxi Nie

An $r$ -uniform hypergraph has $(q, p)$ -property if any set of $q$ vertices spans a complete sub-hypergraph on $p$ vertices. Let $t_{r} (n, q, p)$ be the minimum edge density of an $n$ -ve…

Intersecting families with covering number three II

Odd-Sunflowers

On the C-diversity of intersecting hypergraphs

Variations on the Bollobás set-pair theorem

Improved bounds on the maximum diversity of intersecting families

On asymptotic local Turán problems

On the $C$ -diversity of intersecting hypergraphs