15 citations · 86 across the 50 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.CO2011
A new short proof of the EKR theorem
Peter Frankl, Zoltan Furedi
A family F is intersecting if any two members have a nonempty intersection. Erdos, Ko, and Rado showed that |F|\leq {n-1\choose k-1} holds for an intersecting family of k-subsets o…
math.CO2011★ 5 cited
Large matchings in uniform hypergraphs and the conjectures of Erdos and Samuels
Noga Alon, Peter Frankl, Hao Huang +3
In this paper we study conditions which guarantee the existence of perfect matchings and perfect fractional matchings in uniform hypergraphs. We reduce this problem to an old conje…