The following pages link to Peter Frankl (Q168624):
Displaying 50 items.
- A short proof for a theorem of Harper about Hamming-spheres (Q1162510) (← links)
- An extremal problem for two families of sets (Q1165848) (← links)
- Families of finite sets in which no set is covered by the union of two others (Q1166519) (← links)
- Every large set of equidistant (0,+1,-1)-vectors forms a sunflower (Q1167186) (← links)
- Intersection theorems with geometric consequences (Q1171072) (← links)
- A probabilistic proof for the Lym-inequality (Q1172055) (← links)
- Beyond the Erdős-Ko-Rado theorem (Q1174149) (← links)
- Shadows and shifting (Q1175547) (← links)
- A sharpening of Fisher's inequality (Q1175982) (← links)
- Multiply-intersecting families (Q1186135) (← links)
- Some best possible inequalities concerning cross-intersecting families (Q1194751) (← links)
- Sharpening the LYM inequality (Q1200274) (← links)
- On cross-intersecting families (Q1201261) (← links)
- The convex hull of antichains in posets (Q1204518) (← links)
- The uniformity lemma for hypergraphs (Q1205340) (← links)
- The proof of a conjecture of G. O. H. Katona (Q1218425) (← links)
- Families of finite sets containing no k disjoint sets and their union (Q1225052) (← links)
- On Sperner families satisfying an additional condition (Q1226485) (← links)
- On the maximum number of permutations with given maximal or minimal distance (Q1235702) (← links)
- On the minimum number of disjoint pairs in a family of finite sets (Q1240245) (← links)
- Infinite quasigroups with given regular automorphism groups (Q1252299) (← links)
- Families of finite sets satisfying a union condition (Q1253661) (← links)
- A Sperner-type theorem for families of finite sets (Q1254314) (← links)
- Weight functions on the Kneser graph and the solution of an intersection problem of Sali (Q1316646) (← links)
- Minimum shadows in uniform hypergraphs and a generalization of the Takagi function (Q1344233) (← links)
- Families of sets with no matchings of sizes 3 and 4 (Q1621069) (← links)
- Intersection theorems for \(\{0,\pm1\}\)-vectors and \(s\)-cross-intersecting families (Q1681899) (← links)
- Best possible bounds concerning the set-wise union of families (Q1686244) (← links)
- Proof of the Erdős matching conjecture in a new range (Q1686318) (← links)
- Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors (Q1689038) (← links)
- A degree version of the Hilton-Milner theorem (Q1689057) (← links)
- Families with no matchings of size \(s\) (Q1689961) (← links)
- A short proof of Erdős' conjecture for triple systems (Q1701428) (← links)
- Resilient hypergraphs with fixed matching number (Q1715070) (← links)
- On families of sets without \(k\) pairwise disjoint members (Q1745733) (← links)
- New inequalities for families without \(k\) pairwise disjoint members (Q1747778) (← links)
- Partition-free families of sets (Q1752685) (← links)
- Random walks and multiply intersecting families (Q1763876) (← links)
- Traces of antichains (Q1812791) (← links)
- Intersection theorems and mod \(p\) rank of inclusion matrices (Q1813781) (← links)
- Iterated combinatorial density theorems (Q1813782) (← links)
- Quantitative versions of combinatorial partition theorems. (Q1814077) (← links)
- A Helly type theorem for hypersurfaces (Q1819733) (← links)
- On the trace of finite sets (Q1835917) (← links)
- On the number of sets in a null t-design (Q1837690) (← links)
- On the vector space of 0-configurations (Q1839260) (← links)
- The game of \(n\)-times nim (Q1861258) (← links)
- Weighted 3-wise 2-intersecting families (Q1865384) (← links)
- Strong Ramsey properties of simplices (Q1885594) (← links)
- On the section of a convex polyhedron (Q1893178) (← links)
