scientific article; zbMATH DE number 4029608

MaRDI QIDQ3770569zbMATH OpenFDO

Authors Peter Frankl

Publication date 1987

zbMATH Keywords

survey paperextremal set theoryintersecting familiesHilton-Milner theoremKruskal-Katona theoremshiftingErdős-Ko-Rado theoremBrace-Daykin theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Hypergraphs (05C65)

Recommendations

• Beyond the Erdős-Ko-Rado theorem
• More about shifting techniques
• Characterizing maximal shifted intersecting set systems and short injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems
• Extending the Erdős-Ko-Rado theorem
• The maximum size of intersecting and union families of sets

Cited in

(only showing first 100 items - show all)

• The maximum measure of 3-wise t-intersecting families
• VC dimension and a union theorem for set systems
• Shadows and shifting
• Triangle-intersecting families of graphs
• A rainbow \(r\)-partite version of the Erdős-Ko-Rado theorem
• Extremal problems for finite sets
• A refined result on cross-intersecting families
• Intersecting k-uniform families containing all the k-subsets of a given set
• On q-analogues and stability theorems
• A product version of the Erdős-Ko-Rado theorem
• The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families
• On strengthenings of the intersecting shadow theorem
• Tight bounds for Katona's shadow intersection theorem
• A structure theorem for almost low-degree functions on the slice
• Non-trivial 3-wise intersecting uniform families
• On non-trivial families without a perfect matching
• Random walks and multiply intersecting families
• How many colors guarantee a rainbow matching?
• The Erdős-Ko-Rado properties of various graphs containing singletons
• The Erdős-Ko-Rado properties of set systems defined by double partitions
• On Chvàtal's conjecture and a conjecture on families of signed sets
• Erdős-Ko-Rado theorems for simplicial complexes
• Spectral radius and rainbow Hamilton paths of a graph
• Intersection problems in the q-ary cube
• Maxima of the Q-index: forbidden rainbow Hamilton paths, matchings and linear forests
• Simple juntas for shifted families
• EKR type inequalities for 4-wise intersecting families
• scientific article; zbMATH DE number 736295 (Why is no real title available?)
• Best possible bounds on the double-diversity of intersecting hypergraphs
• Intersecting families in \(\begin{pmatrix}[m]\\ \ell\end{pmatrix}\cup\begin{pmatrix}[n]\\ k\end{pmatrix}\)
• Improved bounds concerning the maximum degree of intersecting hypergraphs
• Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
• Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
• A generalization of Fisher's inequality
• Intersecting families, cross-intersecting families, and a proof of a conjecture of Feghali, Johnson and Thomas
• More about shifting techniques
• Proof of the Erdős matching conjecture in a new range
• A generalization of Erdős' matching conjecture
• Beyond the Erdős matching conjecture
• The Erdős matching conjecture and concentration inequalities
• A bipartite Erdős-Ko-Rado theorem
• Erdős matching conjecture for almost perfect matchings
• Multiply-intersecting families
• The number of faces of balanced Cohen-Macaulay complexes and a generalized Macaulay theorem
• The maximum sum of sizes of cross-intersecting families of subsets of a set
• New injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems
• Uniform intersecting families with large covering number
• Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
• Perfect matchings in hypergraphs and the Erdős matching conjecture
• On the complexity of constrained VC-classes
• The structure of maximal non-trivial \(d\)-wise intersecting uniform families with large sizes
• Union of shadows
• The maximum product of sizes of cross-intersecting families
• A short proof of an Erdős-Ko-Rado theorem for compositions
• Strict Erdős-Ko-Rado for simplicial complexes (extended abstract)
• Zero-sum problems -- a survey
• EKR sets for large \(n\) and \(r\)
• Cross-intersecting families of permutations
• On the \(d\)-cluster generalization of Erdős-Ko-Rado
• Erdős-Ko-Rado with conditions on the minimum complementary degree
• A Hilton-Milner-type theorem and an intersection conjecture for signed sets
• AK-type stability theorems on cross t-intersecting families
• Spaces of \(p\)-vectors of bounded rank
• The maximum sum and product of sizes of cross-intersecting families
• Maximum hitting of a set by compressed intersecting families
• On the \(c\)-strong chromatic number of \(t\)-intersecting hypergraphs
• A discrete isodiametric result: the Erdős-Ko-Rado theorem for multisets
• Maximum hitting for n sufficiently large
• The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton-Milner family
• scientific article; zbMATH DE number 2192161 (Why is no real title available?)
• Two-regular subgraphs of odd-uniform hypergraphs
• Families with restricted matching number and multiply covered shadows
• A proof of Frankl's conjecture on cross-union families
• Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
• The influence of variables in product spaces
• Old and new applications of Katona's circle
• Minimum degree and diversity in intersecting antichains
• Multiple cross-intersecting families of signed sets
• On t-intersecting families of signed sets and permutations
• Non-trivial intersecting and non-empty cross-intersecting families of independent sets in graphs
• Non-trivial \(t\)-intersecting separated families
• Families of finite sets satisfying intersection restrictions
• Intersecting k-uniform families containing a given family
• Signless Laplacian spectral conditions for the existence of rainbow k-factors in a collection of graphs
• On families with bounded matching number
• The maximum of the product of nontrivial cross-intersecting 3-graphs
• On the arithmetic mean of the size of cross-union families
• The maximum sum and the maximum product of sizes of cross-intersecting families
• The maximum sum of sizes of non-empty pairwise cross-intersecting families
• Maximizing \(2\)-independents sets in \(3\)-uniform hypergraphs
• On Mubayi's conjecture and conditionally intersecting sets
• A Hilton-Milner theorem for exterior algebras
• On Erdős' extremal problem on matchings in hypergraphs
• Simplicial effective resistance and enumeration of spanning trees
• Matchings and covers in hypergraphs
• Erdős-Ko-Rado and Hilton-Milner theorems for two-forms
• Extremal Problem for Matchings and Rainbow Matchings on Direct Products
• Erdős-Ko-Rado theorem for a restricted universe
• Stability of intersecting families
• The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3770569)