P. Frankl

activity

20112022

most citedOn strengthenings of the intersecting shadow theorem

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

collaborators

Showing math.COShow all

28 papers · 1 filter

math.CO2022★ 1 cited

Turán graphs with bounded matching number

Noga Alon, Peter Frankl

We determine the maximum possible number of edges of a graph with $n$ vertices, matching number at most $s$ and clique number at most $k$ for all admissible values of the parameter…

math.CO2022

Improved bounds concerning the maximum degree of intersecting hypergraphs

Peter Frankl, Jian Wang

For positive integers $n > k > t$ let $(k [ n ])$ denote the collection of all $k$ -subsets of the standard $n$ -element set $[n] = {1, \dots, n}$ . Subsets of $(k [ n ])$ are ca…

math.CO2022

On the maximum of the sum of the sizes of non-trivial cross-intersecting families

Peter Frankl

We consider families of k-subsets of the standard n-set. Two families F, G are said to be cross-intersecting if every member of F has non-empty intersection with every member of G.…

math.CO2022

Intersections and Distinct Intersections in Cross-intersecting Families

Peter Frankl, Jian Wang

Let $F, G$ be two cross-intersecting families of $k$ -subsets of ${1, 2, \dots, n}$ . Let $F \land G$ , $I (F, G)$ d…

math.CO2022★ 2 cited

Graphs without rainbow triangles

Peter Frankl

Let F,G,H be three graphs on the same n vertices. We consider the maximum of the sum and product of the number of their edges subject to the condition in the title.

math.CO2022

Perfect matchings in down-sets

Peter Frankl, Andrey Kupavskii

In this paper, we show that, given two down-sets (simplicial complexes) there is a matching between them that matches disjoint sets and covers the smaller of the two down-sets. Thi…