Peter Frankl

activity

20242026

most citedOn the product of cross-intersecting families with maximal covering number

2 citations · 2 across the 7 of their papers we have counts for

collaborators

Showing 2026 · math.COShow all

3 papers · 2 filters

math.CO2026★ 2 cited

On the product of cross-intersecting families with maximal covering number

Long Lin, Peter Frankl, Hehui Wu

For integers $k, ℓ \geq 2$ let $m (k, ℓ)$ denote the maximum of $∣ F ∣∣ G ∣$ where the maximum is taken over all pairs of cross-intersecting families, $\mathca…

math.CO2026

On the product of cross-intersecting families with small covering number

Peter Frankl, Long Lin, Hehui Wu

A central problem in extremal set theory is to determine or estimate $m (n, k, t), n > 2 k \geq 2 t$ , the maximum size of an intersecting $k$ -graph and covering number at least $t$ (see the…

math.CO2026

Matching and intersection problems for non-trivial $r$ -partite $r$ -uniform hypergraphs

Peter Frankl, Jiaxi Nie

A central theme in extremal combinatorics is the study of the maximum number of edges in an $r$ -uniform hypergraph ( $r$ -graph) with matching number at most $s$ (the Erdős Matching…

On the product of cross-intersecting families with maximal covering number

On the product of cross-intersecting families with small covering number

Matching and intersection problems for non-trivial r-partite r-uniform hypergraphs

Matching and intersection problems for non-trivial $r$ -partite $r$ -uniform hypergraphs