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
Cites work
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 3448595 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On the Shannon capacity of a graph
- The module structure of integral designs
Cited in
(only showing first 100 items - show all)- Stability for t-intersecting families of permutations
- The Erdős-Ko-Rado theorem for singular linear spaces
- Triangle-intersecting families of graphs
- On the Erdős-Ko-Rado theorem and the Bollobás theorem for \(t\)-intersecting families
- An extension of the Erdős-Ko-Rado theorem to uniform set partitions
- The Erdős-Ko-Rado theorem for 2-intersecting families of perfect matchings
- Extremal problems for finite sets
- Extremal problems concerning Kneser-graphs
- A refined result on cross-intersecting families
- Intersecting k-uniform families containing all the k-subsets of a given set
- Erdős-Ko-Rado theorem, Grassmann graphs and \(p^s\)-Kneser graphs for vector spaces over a residue class ring
- An extension of the Erdős–Ko–Rado Theorem
- The Erdős-Ko-Rado theorem for vector spaces
- Using the existence of \(t\)-designs to prove Erdős-Ko-Rado
- scientific article; zbMATH DE number 7731184 (Why is no real title available?)
- A product version of the Erdős-Ko-Rado theorem
- The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families
- Extremal problems for finite sets and convex hulls---a survey
- On strengthenings of the intersecting shadow theorem
- Erdős--Ko--Rado for three sets
- Erdős-Ko-Rado theorems in certain semilattices
- Codes with given distances
- Large disjoint subgraphs with the same order and size
- Hilton-Milner results in projective and affine spaces
- An upper bound on the mean value of the Erdős–Hooley Delta function
- Large non-trivial \(t\)-intersecting families of signed sets
- Extremal problems under dimension constraints.
- Analogues of Milner's theorem for families without long chains and of vector spaces
- Nearly extremal non-trivial cross \(t\)-intersecting families and \(r\)-wise \(t\)-intersecting families
- Intersection problems in the q-ary cube
- The maximum size of 3-wise t-intersecting families
- The Erdős-Ko-Rado theorem for finite affine spaces
- EKR type inequalities for 4-wise intersecting families
- Stability through non-shadows
- 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
- Improved bounds concerning the maximum degree of intersecting hypergraphs
- An analogue of the Erdős-Ko-Rado theorem for weak compositions
- All 2-transitive groups have the EKR-module property
- The Hilton-Milner theorem for attenuated spaces
- Intersecting families, cross-intersecting families, and a proof of a conjecture of Feghali, Johnson and Thomas
- Erdős-Ko-Rado theorems for permutations and set partitions
- A generalization of Erdős' matching conjecture
- An orthogonal basis for functions over a slice of the Boolean hypercube
- A product version of the Hilton-Milner-Frankl theorem
- Multiply-intersecting families
- Size and structure of large \((s,t)\)-union intersecting families
- Colouring lines in projective space
- The maximum sum of sizes of cross-intersecting families of subsets of a set
- Cross-intersecting families and primitivity of symmetric systems
- On the intersection density of the symmetric group acting on uniform subsets of small size
- Colourings without monochromatic disjoint pairs
- Maximal sets of \(k\)-spaces pairwise intersecting in at least a \((k-2)\)-space
- A multiply intersecting Erdős-Ko-Rado theorem -- the principal case
- The maximum product of sizes of cross-intersecting families
- A short proof of an Erdős-Ko-Rado theorem for compositions
- On cocliques in commutative Schurian association schemes of the symmetric group
- Erdős-Ko-Rado theorems on the weak Bruhat lattice
- Intersection theorems for finite general linear groups
- Theorems of Erdős-Ko-Rado type in geometrical settings
- A generalization of the Erdős-Ko-Rado theorem
- On \(k\)-wise \(L\)-intersecting families for simplicial complexes
- An exact result for (0, 1)-vectors
- Extremal G-free induced subgraphs of Kneser graphs
- The Manickam-Miklós-Singhi conjectures for sets and vector spaces
- 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
- Stability of Erd\H{o}s-Ko-Rado Theorems in Circle Geometries
- The Erdős-Ko-Rado theorem for twisted Grassmann graphs
- On \(r\)-cross \(t\)-intersecting families for weak compositions
- The diametric theorem in Hamming spaces---optimal anticodes
- Maximal \(m\)-distance sets containing the representation of the Hamming graph \(H(n, m)\)
- Non-trivial intersecting families
- scientific article; zbMATH DE number 2212132 (Why is no real title available?)
- 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
- A discrete isodiametric result: the Erdős-Ko-Rado theorem for multisets
- Erdős-Ko-Rado theorem for vector spaces over residue class rings
- The maximum product of weights of cross-intersecting families
- Exact solution of some Turán-type problems
- A Deza-Frankl type theorem for set partitions
- Treewidth of the generalized Kneser graphs
- Short proofs of three results about intersecting systems
- On the size of maximal binary codes with 2, 3, and 4 distances
- A common generalization to theorems on set systems with L-intersections
- On t-intersecting families of signed sets and permutations
- Intersection theorems for \((- 1, 0, 1)\)-vectors
- Non-trivial \(t\)-intersecting separated families
- A note on the maximum product-size of non-trivial cross \(t\)-intersecting families
- Erdős-Ko-Rado theorem for matrices over residue class rings
- Erdős-Ko-Rado theorems. Algebraic approaches
- Families of finite sets satisfying intersection restrictions
- A cross-intersection theorem for vector spaces based on semidefinite programming
- scientific article; zbMATH DE number 4085657 (Why is no real title available?)
- Circular coloring and Mycielski construction
- Erdős-Ko-Rado theorems for set partitions with certain block size
- Erd\H os-Ko-Rado type theorems for simplicial complexes via algebraic shifting
- Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs
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)