Peter Frankl

collaborators

2 papers

math.CO2026

Towards the Erdős matching conjecture for 4-uniform hypergraphs: stability and applications

Peter Frankl, Hongliang Lu, Jie Ma +1

A famous conjecture of Erdős asserts that for $k \geq 3$ , the maximum number of edges in an $n$ -vertex $k$ -uniform hypergraph without $s + 1$ pairwise disjoint edges is $\max\{\binom{n…

math.CO2024

Triangle-free triple systems

Peter Frankl, Zoltán Füredi, Ido Goorevitch +2

There are four non-isomorphic configurations of triples that can form a triangle in a $3$ -uniform hypergraph. Forbidding different combinations of these four configurations, fiftee…