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 2025 · math.COShow all

2 papers · 2 filters

math.CO2025

The Hajnal--Rothschild problem

Peter Frankl, Andrey Kupavskii

For a family $F$ define $ν (F, t)$ as the largest $s$ for which there exist $A_{1}, \dots, A_{s} \in F$ such that for $i \neq = j$ we have $∣ A_{i} \cap A_{j} ∣ < t$ . Wha…

math.CO2025

Intersecting Families of Spanning Trees

Peter Frankl, Glenn Hurlbert, Ferdinand Ihringer +4

A family $F$ of spanning trees of the complete graph on $n$ vertices $K_{n}$ is \emph{ $t$ -intersecting} if any two members have a forest on $t$ edges in common. We prove an…