Pages that link to "Item:Q761464"
From MaRDI portal
The following pages link to The exact bound in the Erdős-Ko-Rado theorem (Q761464):
Displaying 50 items.
- Non-trivial intersecting families (Q1069937) (← links)
- The Erdős-Ko-Rado theorem for vector spaces (Q1086589) (← links)
- On the representing number of intersecting families (Q1093635) (← links)
- Codes with given distances (Q1094390) (← links)
- An Erdős-Ko-Rado theorem for integer sequences of given rank (Q1096631) (← links)
- An analogue of the Erdős-Ko-Rado theorem for the distance-regular graphs of bilinear forms (Q1106215) (← links)
- Exact solution of some Turán-type problems (Q1112819) (← links)
- Beyond the Erdős-Ko-Rado theorem (Q1174149) (← links)
- Multiply-intersecting families (Q1186135) (← links)
- Order and disorder in algebraic combinatorics (Q1190772) (← links)
- The diametric theorem in Hamming spaces---optimal anticodes (Q1271885) (← links)
- Erdős-Ko-Rado-type results over \(J_q(n,d),H_q(n,d)\) and their designs (Q1297405) (← links)
- The Erdős-Ko-Rado bound for the function lattice (Q1302151) (← links)
- Extremal problems for finite sets and convex hulls---a survey (Q1356702) (← links)
- Extremal problems under dimension constraints. (Q1417564) (← links)
- On the Erdős-Ko-Rado theorem and the Bollobás theorem for \(t\)-intersecting families (Q1631618) (← links)
- Upper bounds for \(s\)-distance sets and equiangular lines (Q1644979) (← links)
- A common generalization to theorems on set systems with \(\mathcal L\)-intersections (Q1650604) (← links)
- A tale of stars and cliques (Q1671776) (← links)
- Large \(\{0,1,\ldots,t\}\)-cliques in dual polar graphs (Q1679332) (← links)
- A semidefinite programming approach to a cross-intersection problem with measures (Q1683683) (← links)
- Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors (Q1689038) (← links)
- A degree version of the Hilton-Milner theorem (Q1689057) (← links)
- Intersecting families, cross-intersecting families, and a proof of a conjecture of Feghali, Johnson and Thomas (Q1709533) (← links)
- Erdős-Ko-Rado theorem, Grassmann graphs and \(p^s\)-Kneser graphs for vector spaces over a residue class ring (Q1734708) (← links)
- Colourings without monochromatic disjoint pairs (Q1746571) (← links)
- A generalization of Erdős' matching conjecture (Q1753109) (← links)
- An Erdős-Ko-Rado theorem for regular intersecting families of octads (Q1821104) (← links)
- Weighted 3-wise 2-intersecting families (Q1865384) (← links)
- Token graphs (Q1926040) (← links)
- All 2-transitive groups have the EKR-module property (Q2005193) (← links)
- The Hilton-Milner theorem for attenuated spaces (Q2005708) (← links)
- Set systems with positive intersection sizes (Q2012516) (← links)
- Erdős-Ko-Rado theorems on the weak Bruhat lattice (Q2026320) (← links)
- 3-setwise intersecting families of the symmetric group (Q2032892) (← links)
- The structure of large non-trivial \(t\)-intersecting families of finite sets (Q2048354) (← links)
- On strengthenings of the intersecting shadow theorem (Q2049446) (← links)
- Erdős-Ko-Rado theorem for matrices over residue class rings (Q2053711) (← links)
- The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem (Q2107760) (← links)
- Treewidth of the generalized Kneser graphs (Q2121803) (← links)
- Maximal sets of \(k\)-spaces pairwise intersecting in at least a \((k-2)\)-space (Q2121804) (← links)
- Size and structure of large \((s,t)\)-union intersecting families (Q2138583) (← links)
- The maximum sum of sizes of cross-intersecting families of subsets of a set (Q2166267) (← links)
- Extremal \(t\)-intersecting families for direct products (Q2166286) (← links)
- Cross-intersecting subfamilies of levels of hereditary families (Q2185903) (← links)
- Maximal 2-distance sets containing the regular simplex (Q2198391) (← links)
- On the size of shadow-added intersecting families (Q2225446) (← links)
- Analogues of Milner's theorem for families without long chains and of vector spaces (Q2225460) (← links)
- The Erdős-Ko-Rado theorem for 2-intersecting families of perfect matchings (Q2232305) (← links)
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture (Q2237385) (← links)
