The following pages link to Peter Frankl (Q168624):
Displaying 50 items.
- Uniform intersecting families with covering number four (Q1894015) (← links)
- Covers in uniform intersecting families and a counterexample to a conjecture of Lovász (Q1913995) (← links)
- Exponents of uniform \(L\)-systems (Q1919666) (← links)
- Sharp results concerning disjoint cross-intersecting families (Q1987086) (← links)
- On local Turán problems (Q2005200) (← links)
- Extremal set theory for the binomial norm (Q2010646) (← links)
- On non-trivial families without a perfect matching (Q2011158) (← links)
- Beyond the Erdős matching conjecture (Q2033940) (← links)
- Old and new applications of Katona's circle (Q2033941) (← links)
- Minimum degree and diversity in intersecting antichains (Q2036583) (← links)
- On the arithmetic mean of the size of cross-union families (Q2043692) (← links)
- On strengthenings of the intersecting shadow theorem (Q2049446) (← links)
- On the maximum number of distinct intersections in an intersecting family (Q2075511) (← links)
- Best possible bounds on the number of distinct differences in intersecting families (Q2080226) (← links)
- On the size of the product of overlapping families (Q2084272) (← links)
- On well-connected sets of strings (Q2121802) (← links)
- Pseudo sunflowers (Q2143417) (← links)
- On the sum of sizes of overlapping families (Q2166287) (← links)
- The Erdős matching conjecture and concentration inequalities (Q2171025) (← links)
- Intersection theorems for triangles (Q2172651) (← links)
- An improved universal bound for \(t\)-intersecting families (Q2178676) (← links)
- Erdős-Ko-Rado theorem for a restricted universe (Q2185207) (← links)
- On the number of distinct differences in an intersecting family (Q2214062) (← links)
- On the size of shadow-added intersecting families (Q2225446) (← links)
- Analogues of Milner's theorem for families without long chains and of vector spaces (Q2225460) (← links)
- Shattered matchings in intersecting hypergraphs (Q2229336) (← links)
- Asymptotic solution of a Turán-type problem (Q2276984) (← links)
- Mixed matchings in graphs (Q2279983) (← links)
- Incompatible intersection properties (Q2300156) (← links)
- Families of finite sets satisfying intersection restrictions (Q2309551) (← links)
- Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman (Q2312621) (← links)
- On the domination number of a graph defined by containment (Q2332798) (← links)
- Correction to the article: ``Intersection theorems for \((0,\pm1)\)-vectors and \(s\)-cross-intersecting families'' (Q2332800) (← links)
- The Katona theorem for vector spaces (Q2349189) (← links)
- Reflecting a triangle in the plane (Q2366950) (← links)
- New inequalities for cross-intersecting families (Q2404851) (← links)
- A simple proof of the Hilton-Milner theorem (Q2420488) (← links)
- Some exact results for multiply intersecting families (Q2421557) (← links)
- Disjoint edges in separated hypergraphs (Q2445085) (← links)
- Extremal \(k\)-edge-Hamiltonian hypergraphs (Q2476283) (← links)
- Weighted non-trivial multiply intersecting families (Q2495693) (← links)
- The maximum size of 3-wise intersecting and 3-wise union families (Q2502036) (← links)
- An Erdös-Ko-Rado theorem for direct products (Q2563525) (← links)
- Intersecting families of finite sets and fixed-point-free 2-elements (Q2641300) (← links)
- Antichains of fixed diameter (Q2657174) (← links)
- Analogues of Katona's and Milner's theorems for two families (Q2659239) (← links)
- Almost intersecting families (Q2662348) (← links)
- On the maximum number of edges in hypergraphs with fixed matching and clique number (Q2674562) (← links)
- Intersecting families with sunflower shadows (Q2678397) (← links)
- Perfect matchings in down-sets (Q2689497) (← links)
