3 citations · 4 across the 7 of their papers we have counts for
7 papers
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…
Exact solution of the hypergraph Turán problem for -uniform linear paths
Zoltan Furedi, Tao Jiang, Robert Seiver
A -uniform linear path of length , denoted by , is a family of -sets such that for each and $F_i\cap F_j=\…
2-cancellative hypergraphs and codes
Zoltán Füredi
A family of sets F (and the corresponding family of 0-1 vectors) is called t-cancellative if for all distict t+2 members A_1,... A_t and B,C from F the union of A_1,..., A_t and B…
Uniform hypergraphs containing no grids
Zoltán Füredi, Miklós Ruszinkó
A hypergraph is called an r by r grid if it is isomorphic to a pattern of r horizontal and r vertical lines. Three sets form a triangle if they pairwise intersect in three distinct…
Cycle-saturated graphs with minimum number of edges
Zoltan Furedi, Younjin Kim
A graph is called -saturated if it does not contain any copy of , but for any edge in the complement of the graph contains some . The minimum size of an…
Large B_d-free and union-free subfamilies
János Barát, Zoltán Füredi, Ida Kantor +2
For a property and a family of sets $\cF$, let $f(\cF,Γ)$ be the size of the largest subfamily of $\cF$ having property . For a positive integer , let be the min…