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

DOI10.1007/BF02579226zbMATH Open0556.05039OpenAlexW2006901918WikidataQ105583323 ScholiaQ105583323MaRDI QIDQ761464FDOQ761464

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)

• 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 theorems in certain semilattices
• The Erdős-Ko-Rado theorem for finite affine spaces
• Extremal problems under dimension constraints.
• The maximum size of 3-wise \(t\)-intersecting families
• Intersection problems in the \(q\)-ary cube
• EKR type inequalities for 4-wise intersecting families
• 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 multiply intersecting Erdős-Ko-Rado theorem -- the principal case
• A short proof of an Erdős-Ko-Rado theorem for compositions
• 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
• 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
• Some Erdős-Ko-Rado theorems for injections
• Around Borsuk's hypothesis
• Non-trivial \(r\)-wise intersecting families
• An intersection problem for codes
• On the measure of intersecting families, uniqueness and stability
• Beyond the Erdős-Ko-Rado theorem
• Cross \(t\)-intersecting integer sequences from weighted Erdős-Ko-Rado
• An Erdős-Ko-Rado theorem for cross \(t\)-intersecting families
• Improved Upper Bounds Concerning the Erdős-Ko-Rado Theorem
• A cross‐intersection theorem for subsets of a set
• Forbidden Intersections
• Weighted 3-wise 2-intersecting families
• A note on supersaturated set systems
• Uniform eventown problems
• Intersecting faces of a simplicial complex via algebraic shifting
• A sharp bound for the product of weights of cross-intersecting families
• The structure of large non-trivial \(t\)-intersecting families of finite sets
• The eigenvalue method for cross \(t\)-intersecting families
• The eigenvalues of \(q\)-Kneser graphs
• Invitation to intersection problems for finite sets
• Strongly intersecting integer partitions
• On large intersecting subfamilies of uniform setfamilies
• Commutative association schemes
• Around the complete intersection theorem
• Towards extending the Ahlswede-Khachatrian theorem to cross \(t\)-intersecting families
• Cross-intersecting Erdős-Ko-Rado sets in finite classical polar spaces
• Intersecting families of discrete structures are typically trivial
• The Erdős-Ko-Rado theorem for singular linear spaces
• Triangle-intersecting families of graphs
• 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
• An extension of the Erdős–Ko–Rado Theorem
• Using the existence of \(t\)-designs to prove Erdős-Ko-Rado
• Erdős-Ko-Rado theorem, Grassmann graphs and \(p^s\)-Kneser graphs for vector spaces over a residue class ring
• On strengthenings of the intersecting shadow theorem
• An upper bound on the mean value of the Erdős–Hooley Delta function
• Large non-trivial \(t\)-intersecting families of signed sets
• Hilton-Milner results in projective and affine spaces
• Codes with given distances
• Large disjoint subgraphs with the same order and size
• Nearly extremal non-trivial cross \(t\)-intersecting families and \(r\)-wise \(t\)-intersecting families
• Analogues of Milner's theorem for families without long chains and of vector spaces
• Improved bounds concerning the maximum degree of intersecting hypergraphs
• The EKR property for flag pure simplicial complexes without boundary
• The largest Erdős-Ko-Rado sets in \(2-(v,k,1)\) designs
• An Erdős-Ko-Rado theorem for integer sequences of given rank
• A product version of the Hilton-Milner-Frankl theorem
• All 2-transitive groups have the EKR-module property
• The Hilton-Milner theorem for attenuated spaces

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)