The exact bound in the Erdős-Ko-Rado theorem
From MaRDI portal
Publication:761464
DOI10.1007/BF02579226zbMath0556.05039OpenAlexW2006901918WikidataQ105583323 ScholiaQ105583323MaRDI QIDQ761464
Publication date: 1984
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02579226
Related Items
Erd\H os-Ko-Rado type theorems for simplicial complexes via algebraic shifting, The maximum product of sizes of cross-intersecting families, Intersection theorems under dimension constraints, An orthogonal basis for functions over a slice of the Boolean hypercube, Multiply-intersecting families revisited, Improved Upper Bounds Concerning the Erdős-Ko-Rado Theorem, Non-trivial \(t\)-intersecting families for symplectic polar spaces, Nontrivial t-Intersecting Families for Vector Spaces, On the maximum number of edges in hypergraphs with fixed matching and clique number, An extension of the Erdős-Ko-Rado theorem to set-wise 2-intersecting families of perfect matchings, A refined result on cross-intersecting families, Some inequalities concerning cross-intersecting families of integer sequences, Cross-intersecting non-empty uniform subfamilies of hereditary families, r$r$‐Cross t$t$‐intersecting families via necessary intersection points, Integer sequences without singleton intersection, The maximum product of weights of cross-intersecting families, A family of diameter perfect constant-weight codes from Steiner systems, A product version of the Hilton-Milner theorem, Hilton-Milner results in projective and affine spaces, A product version of the Hilton-Milner-Frankl theorem, Non-trivial \(r\)-wise intersecting families, Intersection theorems for finite general linear groups, An extension of the Erdős-Ko-Rado theorem to uniform set partitions, The Erdős-Ko-Rado theorem for finite affine spaces, Vector sum-intersection theorems, Triangle-intersecting families of graphs, Intersection theorems for \((- 1, 0, 1)\)-vectors, On the intersection density of the symmetric group acting on uniform subsets of small size, Non-trivial \(t\)-intersecting separated families, A note on the maximum product-size of non-trivial cross \(t\)-intersecting families, A proof of Frankl–Kupavskii's conjecture on edge‐union condition, Improved bounds on the maximum diversity of intersecting families, Theorems of Erdős-Ko-Rado type in geometrical settings, High dimensional Hoffman bound and applications in extremal combinatorics, Erdős-Ko-Rado theorems in certain semilattices, The Erdős-Ko-Rado theorem for singular linear spaces, Unnamed Item, The Erdős-Ko-Rado theorem for twisted Grassmann graphs, Diversity, A cross-intersection theorem for vector spaces based on semidefinite programming, A new short proof of a theorem of Ahlswede and Khachatrian, Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs, Forbidden Intersections, Around Borsuk's hypothesis, On large intersecting subfamilies of uniform setfamilies, Cross t-Intersecting Integer Sequences from Weighted Erdős–Ko–Rado, A cross‐intersection theorem for subsets of a set, Partially Symmetric Functions Are Efficiently Isomorphism Testable, A Deza-Frankl type theorem for set partitions, On complete multipartite derangement graphs, The largest Erdős-Ko-Rado sets in \(2-(v,k,1)\) designs, A discrete isodiametric result: the Erdős-Ko-Rado theorem for multisets, An extension of the Erdős–Ko–Rado Theorem, On the bandwidth of the Kneser graph, Treewidth of the generalized Kneser graphs, Maximal sets of \(k\)-spaces pairwise intersecting in at least a \((k-2)\)-space, Intersection problems in the \(q\)-ary cube, The Erdős-Ko-Rado theorem for vector spaces, The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities, On the Erdős-Ko-Rado theorem and the Bollobás theorem for \(t\)-intersecting families, Size and structure of large \((s,t)\)-union intersecting families, On the representing number of intersecting families, Codes with given distances, An Erdős-Ko-Rado theorem for integer sequences of given rank, Upper bounds for \(s\)-distance sets and equiangular lines, Extremal problems for finite sets and convex hulls---a survey, The maximum size of 3-wise \(t\)-intersecting families, A common generalization to theorems on set systems with \(\mathcal L\)-intersections, An analogue of the Erdős-Ko-Rado theorem for the distance-regular graphs of bilinear forms, Exact solution of some Turán-type problems, The maximum sum of sizes of cross-intersecting families of subsets of a set, Extremal \(t\)-intersecting families for direct products, The eigenvalue method for cross \(t\)-intersecting families, A tale of stars and cliques, EKR type inequalities for 4-wise intersecting families, Token graphs, Large \(\{0,1,\ldots,t\}\)-cliques in dual polar graphs, An analogue of the Erdős-Ko-Rado theorem for weak compositions, A semidefinite programming approach to a cross-intersection problem with measures, Cross-intersecting subfamilies of levels of hereditary families, Intersecting \(k\)-uniform families containing all the \(k\)-subsets of a given set, Stability for \(t\)-intersecting families of permutations, A short proof of an Erdős-Ko-Rado theorem for compositions, Cross-intersecting families and primitivity of symmetric systems, An Erdős-Ko-Rado theorem for permutations with fixed number of cycles, A degree version of the Hilton-Milner theorem, The eigenvalues of \(q\)-Kneser graphs, A note on the Manickam-Miklós-Singhi conjecture for vector spaces, The Cameron-Liebler problem for sets, A non-trivial intersection theorem for permutations with fixed number of cycles, A generalization of the Erdős-Ko-Rado theorem to \(t\)-designs in certain semilattices, Maximal 2-distance sets containing the regular simplex, A new short proof of the EKR theorem, Stability for intersecting families in \(\mathrm{PGL}(2,q)\), Intersecting families, cross-intersecting families, and a proof of a conjecture of Feghali, Johnson and Thomas, Extremal problems under dimension constraints., The Manickam-Miklós-Singhi conjectures for sets and vector spaces, An Erdős-Ko-Rado theorem for cross \(t\)-intersecting families, An intersection problem for codes, Beyond the Erdős-Ko-Rado theorem, On the size of shadow-added intersecting families, Analogues of Milner's theorem for families without long chains and of vector spaces, Erdős-Ko-Rado theorem, Grassmann graphs and \(p^s\)-Kneser graphs for vector spaces over a residue class ring, The Erdős-Ko-Rado theorem for 2-intersecting families of perfect matchings, Cross-intersecting Erdős-Ko-Rado sets in finite classical polar spaces, Erdős-Ko-Rado theorems for permutations and set partitions, Multiply-intersecting families, A note on supersaturated set systems, Uniform eventown problems, The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture, Intersecting faces of a simplicial complex via algebraic shifting, Order and disorder in algebraic combinatorics, A sharp bound for the product of weights of cross-intersecting families, Colourings without monochromatic disjoint pairs, Around the complete intersection theorem, Towards extending the Ahlswede-Khachatrian theorem to cross \(t\)-intersecting families, A generalization of Erdős' matching conjecture, The minimum number of disjoint pairs in set systems and related problems, A multiply intersecting Erdős-Ko-Rado theorem -- the principal case, On the measure of intersecting families, uniqueness and stability, A product version of the Erdős-Ko-Rado theorem, Some Erdős-Ko-Rado theorems for injections, All 2-transitive groups have the EKR-module property, The Hilton-Milner theorem for attenuated spaces, Circular coloring and Mycielski construction, Intersecting families of discrete structures are typically trivial, Set systems with positive intersection sizes, Erdős-Ko-Rado theorems on the weak Bruhat lattice, Stability versions of Erdős-Ko-Rado type theorems via isoperimetry, An exact result for \((0, \pm 1)\)-vectors, Extremal \(G\)-free induced subgraphs of Kneser graphs, 3-setwise intersecting families of the symmetric group, Maximal \(m\)-distance sets containing the representation of the Hamming graph \(H(n, m)\), Invitation to intersection problems for finite sets, Strongly intersecting integer partitions, The structure of large non-trivial \(t\)-intersecting families of finite sets, Erdős-Ko-Rado theorems for set partitions with certain block size, The EKR property for flag pure simplicial complexes without boundary, On strengthenings of the intersecting shadow theorem, Erdős-Ko-Rado theorem for matrices over residue class rings, The diametric theorem in Hamming spaces---optimal anticodes, Families of finite sets satisfying intersection restrictions, Large disjoint subgraphs with the same order and size, On \(t\)-intersecting families of signed sets and permutations, An Erdős-Ko-Rado theorem for regular intersecting families of octads, Using the existence of \(t\)-designs to prove Erdős-Ko-Rado, Commutative association schemes, Erdős-Ko-Rado-type results over \(J_q(n,d),H_q(n,d)\) and their designs, On \(r\)-cross \(t\)-intersecting families for weak compositions, Extremal problems concerning Kneser-graphs, The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem, Weighted 3-wise 2-intersecting families, Non-trivial intersecting families, Colouring lines in projective space
Cites Work
