The exact bound in the Erdős-Ko-Rado theorem

DOI10.1007/BF02579226zbMATH Open0556.05039OpenAlexW2006901918WikidataQ105583323 ScholiaQ105583323MaRDI QIDQ761464FDOQ761464

Authors: Richard M. Wilson 

Publication date: 1984

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579226

Recommendations

• A generalization of the Erdős-Ko-Rado theorem
• A generalization of the Erdős-Ko-Rado theorem
• scientific article; zbMATH DE number 3900758
• Beyond the Erdős-Ko-Rado theorem
• Improved Upper Bounds Concerning the Erdős-Ko-Rado Theorem
• Extending the Erdős-Ko-Rado theorem
• scientific article; zbMATH DE number 5019923
• A new generalization of the Erdős-Ko-Rado theorem
• The Erdős-Ko-Rado bound for the function lattice
• Sharp threshold for the Erdős–Ko–Rado theorem

zbMATH Keywords

extremal set systemsextremal familyErdős-Ko-Rado theorem

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Cites Work

• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On the Shannon capacity of a graph
• Title not available (Why is that?)
• Title not available (Why is that?)
• The module structure of integral designs
• Title not available (Why is that?)

Cited In (only showing first 100 items - show all)

• Extremal problems for finite sets
• Title not available (Why is that?)
• On the Erdős-Ko-Rado theorem and the Bollobás theorem for \(t\)-intersecting families
• The Erdős-Ko-Rado theorem for 2-intersecting families of perfect matchings
• On strengthenings of the intersecting shadow theorem
• Codes with given distances
• Large disjoint subgraphs with the same order and size
• The maximum size of 3-wise \(t\)-intersecting families
• EKR type inequalities for 4-wise intersecting families
• An Erdős-Ko-Rado theorem for integer sequences of given rank
• Size and structure of large \((s,t)\)-union intersecting families
• The maximum sum of sizes of cross-intersecting families of subsets of a set
• A multiply intersecting Erdős-Ko-Rado theorem -- the principal case
• The maximum product of sizes of cross-intersecting families
• An exact result for \((0, \pm 1)\)-vectors
• Extremal \(G\)-free induced subgraphs of Kneser graphs
• Maximal \(m\)-distance sets containing the representation of the Hamming graph \(H(n, m)\)
• Treewidth of the generalized Kneser graphs
• A common generalization to theorems on set systems with \(\mathcal L\)-intersections
• Families of finite sets satisfying intersection restrictions
• Title not available (Why is that?)
• Erdős-Ko-Rado theorems for set partitions with certain block size
• r$r$‐Cross t$t$‐intersecting families via necessary intersection points
• Set systems with positive intersection sizes
• On the bandwidth of the Kneser graph
• Token graphs
• A non-trivial intersection theorem for permutations with fixed number of cycles
• The Cameron-Liebler problem for sets
• Stability versions of Erdős-Ko-Rado type theorems via isoperimetry
• Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors
• A product version of the Hilton-Milner theorem
• Stability for intersecting families in \(\mathrm{PGL}(2,q)\)
• A semidefinite programming approach to a cross-intersection problem with measures
• A tale of stars and cliques
• Sharp threshold for the Erdős–Ko–Rado theorem
• Large \(\{0,1,\ldots,t\}\)-cliques in dual polar graphs
• Some inequalities concerning cross-intersecting families of integer sequences
• Integer sequences without singleton intersection
• Order and disorder in algebraic combinatorics
• A degree version of the Hilton-Milner theorem
• Linear dependencies among subsets of a finite set
• Intersection theorems under dimension constraints
• An Erdős-Ko-Rado theorem for regular intersecting families of octads
• Nontrivial \(t\)-intersecting families for vector spaces
• A general 2-part Erdős-Ko-Rado theorem
• 3-setwise intersecting families of the symmetric group
• The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
• On the representing number of intersecting families
• Vector sum-intersection theorems
• Upper bounds for \(s\)-distance sets and equiangular lines
• An extension of the Erdős-Ko-Rado theorem to uniform set partitions
• Stability for \(t\)-intersecting families of permutations
• A refined result on cross-intersecting families
• Extremal problems concerning Kneser-graphs
• The Erdős-Ko-Rado theorem for vector spaces
• Intersecting \(k\)-uniform families containing all the \(k\)-subsets of a given set
• Extremal problems for finite sets and convex hulls---a survey
• A product version of the Erdős-Ko-Rado theorem
• The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families
• Erdős--Ko--Rado for three sets
• Erdős-Ko-Rado theorems in certain semilattices
• The Erdős-Ko-Rado theorem for finite affine spaces
• Extremal problems under dimension constraints.
• Intersection problems in the \(q\)-ary cube
• An orthogonal basis for functions over a slice of the Boolean hypercube
• Intersecting families, cross-intersecting families, and a proof of a conjecture of Feghali, Johnson and Thomas
• A generalization of Erdős' matching conjecture
• An analogue of the Erdős-Ko-Rado theorem for weak compositions
• Erdős-Ko-Rado theorems for permutations and set partitions
• Colouring lines in projective space
• Multiply-intersecting families
• Cross-intersecting families and primitivity of symmetric systems
• A short proof of an Erdős-Ko-Rado theorem for compositions
• A generalization of the Erdős-Ko-Rado theorem
• Theorems of Erdős-Ko-Rado type in geometrical settings
• The Manickam-Miklós-Singhi conjectures for sets and vector spaces
• The Erdős-Ko-Rado theorem for twisted Grassmann graphs
• An Erdős-Ko-Rado theorem for permutations with fixed number of cycles
• A new short proof of the EKR theorem
• A note on the Manickam-Miklós-Singhi conjecture for vector spaces
• On \(r\)-cross \(t\)-intersecting families for weak compositions
• The diametric theorem in Hamming spaces---optimal anticodes
• Non-trivial intersecting families
• A discrete isodiametric result: the Erdős-Ko-Rado theorem for multisets
• An analogue of the Erdős-Ko-Rado theorem for the distance-regular graphs of bilinear forms
• Erdős-Ko-Rado-type results over \(J_q(n,d),H_q(n,d)\) and their designs
• The maximum product of weights of cross-intersecting families
• A Deza-Frankl type theorem for set partitions
• Exact solution of some Turán-type problems
• Erdős-Ko-Rado theorems. Algebraic approaches
• A cross-intersection theorem for vector spaces based on semidefinite programming
• On \(t\)-intersecting families of signed sets and permutations
• Circular coloring and Mycielski construction
• Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs
• Multiply-intersecting families revisited
• The minimum number of disjoint pairs in set systems and related problems
• The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities
• A generalization of the Erdős-Ko-Rado theorem to \(t\)-designs in certain semilattices
• An Erdős-Ko-Rado theorem for the subcubes of a cube
• Economical tight examples for the biased Erdős-Selfridge theorem

This page was built for publication: The exact bound in the Erdős-Ko-Rado theorem

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