INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
From MaRDI portal
Publication:3281090
DOI10.1093/qmath/12.1.313zbMath0100.01902OpenAlexW2019935404WikidataQ56213500 ScholiaQ56213500MaRDI QIDQ3281090
Chao Ko, Paul Erdős, Richard Rado
Publication date: 1961
Published in: The Quarterly Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/qmath/12.1.313
Related Items
An Erdős-Ko-Rado theorem for finite 2-transitive groups, Structure of independent sets in direct products of some vertex-transitive graphs, Intersection problems in the \(q\)-ary cube, Regular subgraphs of uniform hypergraphs, A problem of Shapozenko on Johnson graphs, EKR sets for large \(n\) and \(r\), Optimal availability quorum systems: theory and practice, The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities, Some bounds for the number of blocks. III., Linear independence, a unifying approach to shadow theorems, A simple removal lemma for large nearly-intersecting families, On the covering number of small symmetric groups and some sporadic simple groups., A stability result for the Katona theorem, The eigenvalue method for cross \(t\)-intersecting families, Cellular resolutions of ideals defined by nondegenerate simplicial homomorphisms, Non-trivial intersecting uniform sub-families of hereditary families, Improved bounds for Erdős' matching conjecture, Maximal independent sets in the covering graph of the cube, A Hilton-Milner-type theorem and an intersection conjecture for signed sets, A hypergraph Turán theorem via Lagrangians of intersecting families, An analogue of the Erdős-Ko-Rado theorem for weak compositions, Anti-Ramsey number of matchings in hypergraphs, Intersecting \(k\)-uniform families containing all the \(k\)-subsets of a given set, Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths, 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 the derangement graph of PGL(\(2,q\)) acting on the projective line, Extremal problems for subset divisors, Treewidth of the Kneser graph and the Erdős-Ko-Rado theorem, The minimum number of nonnegative edges in hypergraphs, An Erdős-Ko-Rado theorem for permutations with fixed number of cycles, On \(q\)-analogues and stability theorems, Hypergraphs with many Kneser colorings, Nonnegative \(k\)-sums, fractional covers, and probability of small deviations, The Lex-Plus-Powers conjecture holds for pure powers, A generalization of the Erdős-Ko-Rado theorem to \(t\)-designs in certain semilattices, A new short proof of the EKR theorem, On a problem of Erdős, Herzog and Schönheim, Unavoidable subhypergraphs: \(\mathbf a\)-clusters, A minimum problem for finite sets of real numbers with nonnegative sum, Set systems without a 3-simplex, Covers in 4-uniform intersecting families with covering number three, Structures and lower bounds for binary covering arrays, Arrangements of \(k\)-sets with intersection constraints, An improved bound for the Manickam-Miklós-Singhi conjecture, The Manickam-Miklós-Singhi conjectures for sets and vector spaces, An Erdős-Ko-Rado theorem for cross \(t\)-intersecting families, Turán problems and shadows. I: Paths and cycles, Edge-colorings of uniform hypergraphs avoiding monochromatic matchings, The maximum size of intersecting and union families of sets, Forbiddance and capacity, Maximum hitting of a set by compressed intersecting families, Erdös-Ko-Rado theorem for ladder graphs, Connector families of graphs, Supersaturation and stability for forbidden subposet problems., Random Kneser graphs and hypergraphs, Rainbow matchings in properly-colored hypergraphs, Cross-intersecting Erdős-Ko-Rado sets in finite classical polar spaces, An Erdős-Ko-Rado theorem for the group \(\mathrm{PSU}(3, q)\), Union-intersecting set systems, A note on supersaturated set systems, Intersecting faces of a simplicial complex via algebraic shifting, The Hilton-Milner theorem for the distance-regular graphs of bilinear forms, A sharp bound for the product of weights of cross-intersecting families, On the stability of some Erdős-Ko-Rado type results, Cross-intersecting pairs of hypergraphs, Constructions and nonexistence results for suitable sets of permutations, On the multicolor Ramsey number for 3-paths of length three, Erdős-Ko-Rado theorems of labeled sets, On random subgraphs of Kneser graphs and their generalizations, Stars on trees, An intersection theorem for systems of finite sets, On the maximum number of edges in a hypergraph with given matching number, Around the complete intersection theorem, Towards extending the Ahlswede-Khachatrian theorem to cross \(t\)-intersecting families, Set families with a forbidden pattern, A size-sensitive inequality for cross-intersecting families, A quasi-stability result for dictatorships in \(S_n\), One more Turán number and Ramsey number for the loose 3-uniform path of length three, The minimum number of disjoint pairs in set systems and related problems, On \(b\)-coloring of powers of hypercubes, Set systems without a simplex or a cluster, A product version of the Erdős-Ko-Rado theorem, Optimal permutation anticodes with the infinity norm via permanents of \((0,1)\)-matrices, Intersecting antichains and shadows in linear lattices, On topological relaxations of chromatic conjectures, Cocliques in the Kneser graph on line-plane flags in \(\mathrm{PG}(4, Q)\), 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)\), A coloring problem for intersecting vector spaces, Set systems with \(k\)-wise \(L\)-intersections and codes with restricted Hamming distances, Invitation to intersection problems for finite sets, Strongly intersecting integer partitions, Maximum hitting for \(n\) sufficiently large, An ordered version of the Erdős-Ko-Rado theorem, The exact bound in the Erdős-Ko-Rado theorem, An extension of a Frankl-Füredi theorem, An Erdős-Ko-Rado theorem for finite classical polar spaces, Independence numbers and chromatic numbers of some distance graphs, More complete intersection theorems, Boolean functions: influence, threshold and noise, Families of sets with no matchings of sizes 3 and 4, The order dimension of two levels of the Boolean lattices, Domination in intersecting hypergraphs, On the Erdős-Ko-Rado theorem and the Bollobás theorem for \(t\)-intersecting families, The Hilton-Milner theorem for finite affine spaces, Two extremal problems on intersecting families, Problems and results in discrete mathematics, Short proofs of the Kneser-Lovász coloring principle, Upper bounds for \(s\)-distance sets and equiangular lines, Extremal problems for finite sets and convex hulls---a survey, A common generalization to theorems on set systems with \(\mathcal L\)-intersections, On the size of set systems on \([n\) not containing weak \((r,\Delta)\)-systems], An extended Euler-Poincaré theorem, Finite algebras with large free spectra, A lower bound on the size of a complex generated by an antichain, An EKR-theorem for finite buildings of type \(D_{\ell }\), Diversity of uniform intersecting families, A tale of stars and cliques, Counterexample to the Frankl-Pach conjecture for uniform, dense families, Large \(\{0,1,\ldots,t\}\)-cliques in dual polar graphs, Some results on Sperner families, An Erdős-Ko-Rado theorem for signed sets, A semidefinite programming approach to a cross-intersection problem with measures, Best possible bounds concerning the set-wise union of families, On counting Sperner families, Proof of the Erdős matching conjecture in a new range, Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors, Regular bipartite graphs and intersecting families, A LYM inequality for induced posets, A degree version of the Hilton-Milner theorem, Families with no matchings of size \(s\), Generalizing Erdős, Moon and Moser's result -- the number of \(k\)-dominating independent sets, Simple hypergraphs with maximal number of adjacent pairs of edges, More about shifting techniques, Erdös-Ko-Rado theorems for a family of trees, On maximal antichains consisting of sets and their complements, Families of vector spaces with \(r\)-wise \(\mathcal{L}\)-intersections, Extremal problems and coverings of the space, Chvátal's conjecture and correlation inequalities, Non-trivially intersecting multi-part families, On set systems determined by intersections, Intersecting families, cross-intersecting families, and a proof of a conjecture of Feghali, Johnson and Thomas, Extremal problems under dimension constraints., An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q), On a biased edge isoperimetric inequality for the discrete cube, On Sperner families in which no k sets have an empty intersection. III, An extension of the Erdoes, Ko, Rado theorem to t-designs, Projective \((2n,n,\lambda,1)\)-designs, Beyond the Erdős-Ko-Rado theorem, Independence number of products of Kneser graphs, Setwise intersecting families in classical Coxeter groups, Shadows and shifting, Superextensions and the depth of median graphs, Partitioning a power set into union-free classes, Non \(t\)-intersecting families of linear spaces over \(GF(q)\), The chromatic number of the \(q\)-Kneser graph for large \(q\), Erdős-Ko-Rado theorem, Grassmann graphs and \(p^s\)-Kneser graphs for vector spaces over a residue class ring, Multiply-intersecting families, Order and disorder in algebraic combinatorics, New injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems, On families of sets without \(k\) pairwise disjoint members, Colourings without monochromatic disjoint pairs, New inequalities for families without \(k\) pairwise disjoint members, Characterization of intersecting families of maximum size in \(\mathrm{PSL}(2,q)\), Some best possible inequalities concerning cross-intersecting families, \(k\)-tuple colorings of the Cartesian product of graphs, Miklós-Manickam-Singhi conjectures on partial geometries, A general framework for discovering and proving theorems of the Erdős- Ko-Rado type, Some intersection theorems, Cycle-connected graphs, n-tuple colorings and associated graphs, Nombres de coloration de l'hypergraphe h-parti complet, The proof of a conjecture of G. O. H. Katona, Interpolation of functions over a measure space and conjectures about memory, Intersection theorems for systems of finite vector spaces, Families of intersecting finite vector spaces, Extremal properties of collections of subsets containing no two sets and their union, On the maximum number of permutations with given maximal or minimal distance, Extensions of the Erdős-Ko-Rado theorem and a statistical application, Contributions to the geometry of Hamming spaces, Collective rationality versus distribution of power for binary social choice functions, Extremal theorems on divisors of a number, Families of finite sets satisfying a union condition, On systems of finite sets with constraints on their unions and intersections, An extremal problem among subsets of a set, The diametric theorem in Hamming spaces---optimal anticodes, A homological approach to two problems on finite sets, Maximal \(s\)-wise \(t\)-intersecting families of sets: Kernels, generating sets, and enumeration, Erdős-Ko-Rado-type results over \(J_q(n,d),H_q(n,d)\) and their designs, Some results on intersecting families of subsets, Graph products and the chromatic difference sequence of vertex-transitive graphs, The multichromatic numbers of some Kneser graphs, On conjectures of Berge and Chvátal, Weight functions on the Kneser graph and the solution of an intersection problem of Sali, Non-empty cross-2-intersecting families of subsets, The Erdős-Ko-Rado theorem for small families, Largest size and union of Helly families, Density results for uniform families, Intersecting families in \(\begin{pmatrix}[m\\ \ell\end{pmatrix}\cup\begin{pmatrix}[n]\\ k\end{pmatrix}\)], The Erdős-Ko-Rado theorem for vector spaces, The maximum number of balancing sets, On the representing number of intersecting families, The maximum number of edges in a 3-graph not containing a given star, An Erdős-Ko-Rado theorem for integer sequences of given rank, On squashed designs, Families of finite sets with minimum shadows, Pairwise intersections and forbidden configurations, Perfect matchings in uniform hypergraphs with large minimum degree, Finite projective spaces and intersecting hypergraphs, A random construction for permutation codes and the covering radius, The maximum size of 3-wise \(t\)-intersecting families, An analogue of the Erdős-Ko-Rado theorem for the distance-regular graphs of bilinear forms, Some intersection theorems on two-valued functions, On the VC-dimension of uniform hypergraphs, Some intersection theorems for ordered sets and graphs, Probabilistic extensions of the Erdős-Ko-Rado property, Erdős-Ko-Rado theorem with conditions on the maximal degree, Exact solution of some Turán-type problems, Intersection theorems in permutation groups, The complexity of multicolouring, Bounding one-way differences, Algebraic shifting of cyclic polytopes and stacked polytopes, EKR type inequalities for 4-wise intersecting families, On the stability of the Erdős-Ko-Rado theorem, The Erdős-Ko-Rado property for some 2-transitive groups, On the Erdős-Ko-Rado property for finite groups, A note on the Manickam-Miklós-Singhi conjecture for vector spaces, Intersection theorems for multisets, The Cameron-Liebler problem for sets, A non-trivial intersection theorem for permutations with fixed number of cycles, Hook-free colorings and a problem of Hanson, Intersection theorems for t-valued functions, An intersection problem for codes, An Erdős-Ko-Rado-type theorem in Coxeter groups., Shadows and intersections: Stability and new proofs, Erdős-Ko-Rado theorems for permutations and set partitions, The edge-diametric theorem in Hamming spaces, Properties of intersecting families of ordered sets, A multiply intersecting Erdős-Ko-Rado theorem -- the principal case, On the measure of intersecting families, uniqueness and stability, On the probability of a rational outcome for generalized social welfare functions on three alternatives, Cross-intersecting families of permutations, Multiple cross-intersecting families of signed sets, Cross \(\mathcal L\)-intersecting families on set systems, Algebraic shifting of strongly edge decomposable spheres, Some Erdős-Ko-Rado theorems for injections, Circular coloring and Mycielski construction, Note on set systems without a strong simplex, Uniformly cross intersecting families, A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations, Set systems with \(\mathcal L\)-intersections modulo a prime number, The covering radius of extreme binary 2-surjective codes, The unbalance of set systems, A generalization of Talbot's theorem about King Arthur and his knights of the round table, On \(t\)-intersecting families of signed sets and permutations, Set systems with union and intersection constraints, An Erdős-Ko-Rado theorem for the subcubes of a cube, Cross-intersecting sub-families of hereditary families, Commutative association schemes, Maximum degree and diversity in intersecting hypergraphs, The Erdős-Ko-Rado properties of various graphs containing singletons, Families intersecting on an interval, Pure \(\mathcal{O}\)-sequences arising from \(2\)-dimensional PS ear-decomposable simplicial complexes, A short proof of a cross-intersection theorem of Hilton, The Erdős-Ko-Rado properties of set systems defined by double partitions, Set systems with cross \(\mathcal L\)-intersection and \(k\)-wise \(\mathcal L\)-intersecting families, Fractional set systems with few disjoint pairs, A generalization of the Erdős-Ko-Rado theorem, A probabilistic variant of Sperner's theorem and of maximal \(r\)-cover free families, Enumeration of intersecting families, On hypergraphs without two edges intersecting in a given number of vertices, Linear dependencies among subsets of a finite set, Great intersecting families of edges in hereditary hypergraphs, On the density of sets of vectors, On disjointly representable sets, On qualitatively independent partitions and related problems, An extremal set theoretical characterization of some Steiner systems, An extremal theorem on divisors of a number, An intersection problem with 6 extremes, More on the Erdős-Ko-Rado theorem for integer sequences, Matching binary convexities, An intersection-union theorem for integer sequences, Intersecting Sperner families and their convex hulls, Extremal problems concerning Kneser-graphs, On coverings of a finite set: Depth and subcovers, Embedding of \(\ell^ k_{\infty}\) in finite dimensional Banach spaces, Forbidding just one intersection, Intersection theorems for vector spaces, Extremal hypergraph problems and convex hulls, The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families, On families in finite lattices, Non-trivial intersecting families, Hamiltonian uniform subset graphs, Families of finite sets in which no set is covered by the union of \(r\) others, A generalization of a theorem of Kruskal, Polytopes determined by hypergraph classes, The mathematics of Bruce Rothschild, An Erdős--Ko--Rado theorem for partial permutations, Erdős-Ko-Rado theorems for ovoidal circle geometries and polynomials over finite fields, Modular and fractional \(L\)-intersecting families of vector spaces, Treewidth of the generalized Kneser graphs, Maximal sets of \(k\)-spaces pairwise intersecting in at least a \((k-2)\)-space, Stability on matchings in 3-uniform hypergraphs, Covering by intersecting families, Multicoloured extremal problems, Extremal problems for pairs of triangles, On maximum intersecting sets in direct and wreath product of groups, Size and structure of large \((s,t)\)-union intersecting families, Clique number of Xor products of Kneser graphs, Uniform intersecting families with covering number four, On the largest intersecting set in \(\mathrm{GL}_2(q)\) and some of its subgroups, Cross-intersecting families of finite sets, Erdős-Ko-Rado sets of flags of finite sets, Breakdown points, breakdown probabilities, midpoint sensitivity curves, and optimization of stack filters, The maximum sum of sizes of cross-intersecting families of subsets of a set, Extremal \(t\)-intersecting families for direct products, On the sum of sizes of overlapping families, On total and edge coloring some Kneser graphs, An algebraic approach to Erdős-Ko-Rado sets of flags in spherical buildings, Sharp bounds for the chromatic number of random Kneser graphs, The Erdős matching conjecture and concentration inequalities, On intersecting families of independent sets in trees, Intersection theorems for triangles, A result concerning two conjectures of Berge and Chvátal, An improved universal bound for \(t\)-intersecting families, Erdős-Ko-Rado theorem for a restricted universe, Structural results for conditionally intersecting families and some applications, Cross-intersecting subfamilies of levels of hereditary families, Anzahl formulas of subspaces in symplectic spaces and their applications, Shadows and intersections in vector spaces, On cross \(t\)-intersecting families of sets, Unavoidable hypergraphs, On symmetric intersecting families, Partition-free families of sets, The Cayley isomorphism property for Cayley maps, Coloring cross-intersecting families, Extremal numbers for directed hypergraphs with two edges, The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four, The feasible region of hypergraphs, The Erdős-Ko-Rado theorem for the derangement graph of the projective general linear group acting on the projective space, Erdős-Ko-Rado theorem for irreducible imprimitive reflection groups, Partitioning ordered hypergraphs, All 2-transitive groups have the EKR-module property, The Hilton-Milner theorem for attenuated spaces, An Erdős-Ko-Rado theorem for unions of length 2 paths, Erdős-Ko-Rado with conditions on the minimum complementary degree, Random walks and multiply intersecting families, Refuting conjectures in extremal combinatorics via linear programming, On set systems without a simplex-cluster and the junta method, Extremal set theory for the binomial norm, Disjoint pairs in set systems with restricted intersection, On non-trivial families without a perfect matching, Set systems with positive intersection sizes, Compression and Erdős-Ko-Rado graphs, Graphs with the Erdős-Ko-Rado property, Erdős-Ko-Rado theorems on the weak Bruhat lattice, 3-setwise intersecting families of the symmetric group, Saturation problems in the Ramsey theory of graphs, posets and point sets, Beyond the Erdős matching conjecture, Old and new applications of Katona's circle, On the chromatic number of a subgraph of the Kneser graph, Minimum degree and diversity in intersecting antichains, On the \(d\)-cluster generalization of Erdős-Ko-Rado, The toughness of Kneser graphs, The general position problem on Kneser graphs and on some graph operations, On the arithmetic mean of the size of cross-union families, On \(L\)-close Sperner systems, The structure of large non-trivial \(t\)-intersecting families of finite sets, Tight bounds for Katona's shadow intersection theorem, On the \(P_3\)-hull number of Kneser graphs, On strengthenings of the intersecting shadow theorem, Erdős-Ko-Rado theorem for matrices over residue class rings, Triangle-free subgraphs of hypergraphs, Matchings and covers in hypergraphs, A distributed algorithm for spectral sparsification of graphs with applications to data clustering, Bollobás-type theorems for hemi-bundled two families, An Erdős-Ko-Rado theorem for regular intersecting families of octads, Kruskal-Katona function and variants of cross-intersecting antichains, A short proof of Talbot's theorem for intersecting separated sets, On the chromatic number of two generalized Kneser graphs, Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphs, The number of \(k\)-intersections of an intersecting family of \(r\)-sets, Multiply intersecting families of sets, Stable sets of maximal size in Kneser-type graphs, On the maximum number of distinct intersections in an intersecting family, NP-completeness of a family of graph-colouring problems, Best possible bounds on the number of distinct differences in intersecting families, On families of finite sets with bounds on unions and intersections, On the size of the product of overlapping families, Extremal problems among subsets of a set, Sperner systems consisting of pairs of complementary subsets, Erdős-Ko-Rado from Kruskal-Katona, Vector-spread monomial ideals and Eliahou-Kervaire type resolutions, The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem, The \(t\)-intersection problem in the truncated Boolean lattice, Weighted 3-wise 2-intersecting families, The EKR-module property of pseudo-Paley graphs of square order, Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\), The maximum product of sizes of cross-intersecting families, Erdős-Ko-Rado type theorems for simplicial complexes, Transversals and independence in linear hypergraphs with maximum degree two, Intersecting \(P\)-free families, The weighted complete intersection theorem, Multicolor Ramsey numbers and restricted Turán numbers for the loose 3-uniform path of length three, A bipartite Erdős-Ko-Rado theorem, Intersection theorems under dimension constraints, Minimal paths and cycles in set systems, Refined Turán numbers and Ramsey numbers for the loose 3-uniform path of length three, Intersecting \(k\)-uniform families containing a given family, Almost cross-intersecting and almost cross-Sperner pairs of families of sets, An intersection theorem for four sets, Multiply-intersecting families revisited, Chain intersecting families, Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture, The maximum size of a partial spread in a finite projective space, A strengthened inequality of Alon-Babai-Suzuki's conjecture on set systems with restricted intersections modulo \(p\), On semi-transitive orientability of Kneser graphs and their complements, The formula for Turán number of spanning linear forests, An Erdős-Ko-Rado result for sets of pairwise non-opposite lines in finite classical polar spaces, A simple proof of the Hilton-Milner theorem, Structure and supersaturation for intersecting families, Some exact results for multiply intersecting families, Turán, involution and shifting, Cross-intersecting non-empty uniform subfamilies of hereditary families, A generalization of Kneser graphs, On the Duffin-Schaeffer conjecture, Graphical designs and extremal combinatorics, Triangle-intersecting families of graphs, Maximal 2-distance sets containing the regular simplex, Stability for vertex isoperimetry in the cube, Erdős-Ko-Rado theorems for chordal graphs and trees, Erdős-Ko-Rado theorems for simplicial complexes, Theorems of Erdős-Ko-Rado type in polar spaces, Bounds on sets with few distances, Hypergraph Turán numbers of linear cycles, The maximum number of cliques in hypergraphs without large matchings, Theorems of Erdős-Ko-Rado type in geometrical settings, A new proof for the Erdős-Ko-Rado theorem for the alternating group, Erdős-Ko-Rado theorems in certain semilattices, Size-maximal symmetric difference-free families of subsets of \([n\)], Linear hypergraphs with large transversal number and maximum degree two, Set systems with restricted \(k\)-wise \(\mathcal{L}\)-intersections modulo a prime number, The Erdős-Ko-Rado theorem for singular linear spaces, On the number of distinct differences in an intersecting family, The Erdős-Ko-Rado theorem for twisted Grassmann graphs, Forbidding a set difference of size 1, Restricted intersecting families on simplicial complex, Non-trivial \(d\)-wise intersecting families, Hedetniemi's conjecture is asymptotically false, Forbidding just one intersection, for permutations, On the size of shadow-added intersecting families, Analogues of Milner's theorem for families without long chains and of vector spaces, Threshold graphs, shifted complexes, and graphical complexes, On triangles in derangement graphs, Shattered matchings in intersecting hypergraphs, Neighborhood complexes and Kronecker double coverings, The Erdős-Ko-Rado theorem for 2-intersecting families of perfect matchings, Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification, On the tractability of \(( k , i )\)-coloring, New results on simplex-clusters in set systems, The Erdős-Ko-Rado theorem for 2-pointwise and 2-setwise intersecting permutations, The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture, New results related to a conjecture of Manickam and Singhi, A new short proof of a theorem of Ahlswede and Khachatrian, Game saturation of intersecting families, The largest Erdős-Ko-Rado sets of planes in finite projective and finite classical polar spaces, Forbidding complete hypergraphs as traces, Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs, Intersecting families of discrete structures are typically trivial, An Erdős-Ko-Rado theorem for restricted signed sets, On the Hadwiger number of Kneser graphs and their random subgraphs, Stability versions of Erdős-Ko-Rado type theorems via isoperimetry, On the maximum size of subfamilies of labeled set with given matching number, Mixed matchings in graphs, Erdős-Ko-Rado theorems for set partitions with certain block size, Vertex-isoperimetric stability in the hypercube, The EKR property for flag pure simplicial complexes without boundary, Classification of maximum hittings by large families, Families of finite sets satisfying intersection restrictions, Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman, On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\), Cameron-Liebler sets of generators in finite classical polar spaces, Short proof of two cases of Chvátal's conjecture, On the chromatic number of random subgraphs of a certain distance graph, Topological bounds on the dimension of orthogonal representations of graphs, \(d\)-cluster-free sets with a given matching number, Colouring set families without monochromatic \(k\)-chains, Degree versions of theorems on intersecting families via stability, Regular intersecting families, On \(r\)-cross \(t\)-intersecting families for weak compositions, Most probably intersecting hypergraphs, On the number of maximal intersecting \(k\)-uniform families and further applications of Tuza's set pair method, A Deza-Frankl type theorem for set partitions, Cross-intersecting families of vectors, Equidistant codes in the Grassmannian, 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, On the bandwidth of the Kneser graph, A \(t\)-intersecting Hilton-Milner theorem for vector spaces, Intersecting families of graphs of functions over a finite field, The covering lemma and q-analogues of extremal set theory problems, r$r$‐Cross t$t$‐intersecting families via necessary intersection points, Integer sequences without singleton intersection, Rainbow Turán numbers of matchings and forests of hyperstars in uniform hypergraphs, Intersection density of cubic symmetric graphs, On t-Intersecting Hypergraphs with Minimum Positive Codegrees, Very well-covered graphs with the Erdős-Ko-Rado property, Graphs with equal Grundy domination and independence number, Optimal and extremal graphical designs on regular graphs associated with classical parameters, Uniform hypergraphs under certain intersection constraints between hyperedges, Independence numbers of Johnson-type graphs, Rational approximations of irrational numbers, On finding constrained independent sets in cycles, A family of diameter perfect constant-weight codes from Steiner systems, A product version of the Hilton-Milner theorem, Ramsey-Turán type results for matchings in edge colored graphs, Forbidden intersections for codes, Missing digits and good approximations, Intersecting families of sets are typically trivial, A product version of the Hilton-Milner-Frankl theorem, Induced forests in some distance-regular graphs, Fixed-Parameter Algorithms for the Kneser and Schrijver Problems, Non-trivial \(r\)-wise intersecting families, Intersection theorems for finite general linear groups, A short note on supersaturation for oddtown and eventown, An extension of the Erdős-Ko-Rado theorem to uniform set partitions, Formalising the Kruskal-Katona theorem in Lean, A Kruskal-Katona-type theorem for graphs: \(q\)-Kneser graphs, Maximal fractional cross-intersecting families, On Multicolor Ramsey Numbers of Triple System Paths of Length 3, Uniform intersecting families with large covering number, Localized versions of extremal problems, Triangles in \(r\)-wise \(t\)-intersecting families, Vector sum-intersection theorems, The structure of maximal non-trivial \(d\)-wise intersecting uniform families with large sizes, Families with restricted matching number and multiply covered shadows, A proof of Frankl's conjecture on cross-union families, On the star of the family of independent sets in a graph, Intersection theorems for \((- 1, 0, 1)\)-vectors, Non-trivial \(t\)-intersecting separated families, Treewidth of the \(q\)-Kneser graphs, A note on the maximum product-size of non-trivial cross \(t\)-intersecting families, Minimum number of maximal dissociation sets in trees, Reflect-push methods. Part I: Two dimensional techniques, Trivial colors in colorings of Kneser graphs, KKL's influence on me, Mathematics of computation through the lens of linear equations and lattices, A proof of Frankl–Kupavskii's conjecture on edge‐union condition, Improved bounds on the maximum diversity of intersecting families, Erd\H os-Ko-Rado type theorems for simplicial complexes via algebraic shifting, Combinatorics in the exterior algebra and the Bollobás Two Families Theorem, Structured Codes of Graphs, On Disjoint Cross Intersecting Families of Permutations, On symmetric intersecting families of vectors, Rainbow version of the Erdős Matching Conjecture via concentration, A Stability Result on Matchings in 3-Uniform Hypergraphs, Circulant almost cross intersecting families, What is an infinite design?, Families with no perfect matchings, The Distortion of Locality Sensitive Hashing, Some Erdös-Ko-Rado results for linear and affine groups of degree two, Turán numbers of sunflowers, Multicolour Sunflowers, Extremal Problems on the Hypercube and the Codegree Turán Density of Complete $r$-Graphs, The number of s-separated k-sets in various circles, A Group-Theoretic Setting for Some Intersecting Sperner Families, Improved Upper Bounds Concerning the Erdős-Ko-Rado Theorem, The Maximum k-Colorable Subgraph Problem and Related Problems, On Intersecting Chains in Boolean Algebras, Nontrivial t-Intersecting Families for Vector Spaces, An extension of the Erdős-Ko-Rado theorem to set-wise 2-intersecting families of perfect matchings, Suboptimal \(s\)-union families and \(s\)-union antichains for vector spaces, An algebraic groups perspective on Erdős–Ko–Rado, \(K_4\)-intersecting families of graphs, On the Holroyd-Talbot conjecture for sparse graphs, Turán and Ramsey numbers for 3‐uniform minimal paths of length 4, Extremal Problems for Hypergraph Blowups of Trees, The unique coclique extension property for apartments of buildings, A refined result on cross-intersecting families, The Profile Polytope of Nontrivial Intersecting Families, Sharp threshold for the Erdős–Ko–Rado theorem, Extremal Problem for Matchings and Rainbow Matchings on Direct Products, On families with bounded matching number, Some inequalities concerning cross-intersecting families of integer sequences, Stability of intersecting families, Minimal scrambling sets of simple orders, Extremal problems in hypergraph colourings, Counting Intersecting and Pairs of Cross-Intersecting Families, Intersecting Families in Symmetric Unions of Direct Products of Set Families, Sperner's Problem forG-Independent Families, The isometry group of phylogenetic tree space is $S_n$, A Rainbow r-Partite Version of the Erdős–Ko–Rado Theorem, Erdős–Ko–Rado for Random Hypergraphs: Asymptotics and Stability, Uniform s-Cross-Intersecting Families, A Note on Large H-Intersecting Families, Almost-Fisher families, On the Distortion of Locality Sensitive Hashing, Intersecting families in classical Coxeter groups, A new generalization of the Erdős-Ko-Rado theorem, Diversity, Sunflowers and -intersecting families, Subspace code based on flats in affine space over finite fields, On the structure of subsets of the discrete cube with small edge boundary, An Erdős-Ko-Rado theorem for multisets, Paul Erdős, 1913-1996, A cross-intersection theorem for vector spaces based on semidefinite programming, An Unstable Hypergraph Problem with a Unique Optimal Solution, A new generalization of the Erdős-Ko-Rado theorem, Some intersection theorems for structures, Some intersection theorems for structures, Intersection properties of subsets of integers, The Weight in Enumeration, Subsets Close to Invariant Subsets for Group Actions, On intersecting families of finite sets, On intersecting families of finite sets, Anzahl theorems in geometry oft-singular classical groups and their applications, Algebraic Shifting of Finite Graphs, Intersecting families of permutations, The maximum size of 4-wise 2-intersecting and 4-wise 2-union families, Intersecting families, signed sets, and injection, Zeros and amoebas of partition functions, On Mubayi's Conjecture and Conditionally Intersecting Sets, A general 2-part Erdȍs-Ko-Rado theorem, A hierarchy of maximal intersecting triple systems, Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems, On large intersecting subfamilies of uniform setfamilies, Grundy domination and zero forcing in Kneser graphs, On Erdős–Ko–Rado for Random Hypergraphs II, Maximal k-Intersecting Families of Subsets and Boolean Functions, On Erdős–Ko–Rado for random hypergraphs I, Nonhomogeneous analytic families of trees, Maximal commutative subalgebras of a Grassmann algebra, An Upper Bound for Weak $B_k$-Sets, Matching criticality in intersecting hypergraphs, On the general position problem on Kneser graphs, Unnamed Item, A cross‐intersection theorem for subsets of a set, The Erdös-Ko-Rado Theorem for Integer Sequences, Maximum Size Intersecting Families of Bounded Minimum Positive Co-degree, Sparse Kneser graphs are Hamiltonian, Partially Symmetric Functions Are Efficiently Isomorphism Testable, Turán Problems and Shadows III: Expansions of Graphs, On the Erdos-Ko-Rado property of finite groups of order a product of three primes, Commutative subalgebras of the Grassmann algebra, On complete multipartite derangement graphs, On the Multichromatic Number of s‐Stable Kneser Graphs, Graphs defined by coverings of a set, Path Separation by Short Cycles, The Game Saturation Number of a Graph, A Helly Theorem for Sets, Most Probably Intersecting Families of Subsets, Compressions and Probably Intersecting Families, Some Erdös–Ko–Rado Theorems for Chevalley Groups, The Size of a Hypergraph and its Matching Number, Probabilities for Intersecting Systems and Random Subsets of Finite Sets, TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM, The \((p, q)\)-extremal problem and the fractional chromatic number of Kneser hypergraphs, On regular 3-wise intersecting families, Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture, Independence numbers and chromatic numbers of the random subgraphs of some distance graphs, On the Erdős–Ginzburg–Ziv invariant and zero-sum Ramsey number for intersecting families, Fredman–Komlós bounds and information theory, Shannon capacity and the categorical product, Fractional cross intersecting families, Analogues of Katona's and Milner's theorems for two families, Almost intersecting families, Remarks on the Erdős matching conjecture for vector spaces, Non-trivial \(t\)-intersecting families for symplectic polar spaces, The spectral radii of intersecting uniform hypergraphs, Cross-Intersecting Families of Vectors, Combinatorics of antiprism triangulations, Approximation by juntas in the symmetric group, and forbidden intersection problems, The maximum Lagrangian of 5-uniform hypergraphs without containing two edges intersecting at a vertex, Maximal independent sets in clique-free graphs, On the maximum number of edges in hypergraphs with fixed matching and clique number, Intersecting families with sunflower shadows, Applications of graph containers in the Boolean lattice, Embedding dimensions of simplicial complexes on few vertices, Set Systems with L-Intersections and k-Wise L-Intersecting Families, The maximum product of weights of cross-intersecting families, On nonzero component graph of vector spaces over finite fields, Hilton-Milner results in projective and affine spaces, The Erdős-Ko-Rado theorem for finite affine spaces, Regularity Conditions and Intersecting Hypergraphs, On the intersection density of the symmetric group acting on uniform subsets of small size, Perfect matchings in down-sets, On the boxicity of Kneser graphs and complements of line graphs, Non-trivial 3-wise intersecting uniform families, Characterizing maximal shifted intersecting set systems and short injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems, The structure of large intersecting families, Constructions of binary codes with two distances, Erdős-Ko-Rado and Hilton-Milner theorems for two-forms, High dimensional Hoffman bound and applications in extremal combinatorics, On inertia and ratio type bounds for the \(k\)-independence number of a graph and their relationship, Intersections and distinct intersections in cross-intersecting families, Saturation problems in convex geometric hypergraphs, The maximum measure of 3-wise \(t\)-intersecting families, G-Intersection Theorems for Matchings and Other Graphs, On the Number ofk-Dominating Independent Sets, On symmetric 3-wise intersecting families, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Families of finite sets satisfying an intersection condition, Erdős–Ko–Rado in Random Hypergraphs, Orthogonal partitions and covering of graphs, Simplex Stability, Intersecting Families are Essentially Contained in Juntas, A Note on Uniquely lntersectable Graphs, Extensions of the Erdös-Ko-Rado Theorem, Unnamed Item, Unnamed Item, Structural aspects of decisional power, Erdös–Ko–Rado Theorem—22 Years Later, The Chromatic Number of Kneser Hypergraphs, Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs, Extremal problems among subsets of a set. (Reprint), Forbidden Intersections, The maximum size of 3-wise intersecting and 3-wise union families, Independence and coloring properties of direct products of some vertex-transitive graphs, The maximum sum and the maximum product of sizes of cross-intersecting families, A note on the Manickam-Miklós-Singhi conjecture, Linear trees in uniform hypergraphs, On families of finite sets no two of which intersect in a singleton, Around Borsuk's hypothesis, Removal and Stability for Erdös--Ko--Rado, Maximum stable sets in analogs of Kneser and complete graphs, Algebraic shifting and graded Betti numbers, On “stability” in the Erdös--Ko--Rado Theorem, ON THE PARTIAL DIFFERENCE SETS IN CAYLEY DERANGEMENT GRAPHS, Fundamentals of coding type problems, An extremal problem for 3-graphs, An extremal problem on the set of noncoprime divisors of a number, The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton–Milner family, On r-Cross Intersecting Families of Sets, Cross t-Intersecting Integer Sequences from Weighted Erdős–Ko–Rado, A simple proof of the Erdős-Chao Ko-Rado theorem, Sperner Partition Systems, Two applications (for search theory and truth functions) of Sperner type theorems, Families of \(k\)-independent sets, A generalization of the Erdős-Ko-Rado theorem on finite set systems, Some Results on Systems of Finite Sets That Satisfy a Certain Intersection Condition, A Katona-type proof of an Erdős-Ko-Rado-type theorem, Structure and stability of triangle-free set systems, Kneser Colorings of Uniform Hypergraphs, The Edge-Diametric Theorem in Hamming Spaces, An extension of the Erdős–Ko–Rado Theorem, Sets of finite sets satisfying union conditions, Loose laplacian spectra of random hypergraphs, On maximal isolation sets in the uniform intersection matrix, Projectivity and independent sets in powers of graphs
