On intersecting families of finite sets
From MaRDI portal
Publication:5906050
DOI10.1016/0097-3165(78)90003-1zbMath0384.05002OpenAlexW1992844673WikidataQ105583666 ScholiaQ105583666MaRDI QIDQ5906050
Publication date: 1978
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(78)90003-1
Related Items
Intersection theorems under dimension constraints, Size and structure of large \((s,t)\)-union intersecting families, Pseudo sunflowers, Pairwise intersections and forbidden configurations, Finite projective spaces and intersecting hypergraphs, Multiply-intersecting families revisited, On generalized Turán number of two disjoint cliques, On the kernel of intersecting families, On the Erdős–Ginzburg–Ziv invariant and zero-sum Ramsey number for intersecting families, Erdős-Ko-Rado theorem with conditions on the maximal degree, Non-trivial \(t\)-intersecting families for symplectic polar spaces, Nontrivial t-Intersecting Families for Vector Spaces, Stability for \(t\)-intersecting families of permutations, Generalized Turán results for intersecting cliques, Intersecting families with sunflower shadows, A degree version of the Hilton-Milner theorem, On t-Intersecting Hypergraphs with Minimum Positive Codegrees, Intersection theorems for multisets, A non-trivial intersection theorem for permutations with fixed number of cycles, A product version of the Hilton-Milner theorem, A product version of the Hilton-Milner-Frankl theorem, Non-trivial \(r\)-wise intersecting families, 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, Non-trivial \(t\)-intersecting separated families, Improved bounds on the maximum diversity of intersecting families, Extremal problems and coverings of the space, Non-trivially intersecting multi-part families, The structure of large intersecting families, Maximum degree and fractional matchings in uniform hypergraphs, Maximum hitting of a set by compressed intersecting families, On the stability of the Erdös-Ko-Rado theorem, Diversity, Order and disorder in algebraic combinatorics, On the stability of some Erdős-Ko-Rado type results, Colourings without monochromatic disjoint pairs, A new short proof of a theorem of Ahlswede and Khachatrian, A general framework for discovering and proving theorems of the Erdős- Ko-Rado type, Some intersection theorems, A multiply intersecting Erdős-Ko-Rado theorem -- the principal case, On the measure of intersecting families, uniqueness and stability, Some Erdős-Ko-Rado theorems for injections, Erdős-Ko-Rado with conditions on the minimum complementary degree, Erdös–Ko–Rado Theorem—22 Years Later, The Chromatic Number of Kneser Hypergraphs, A note on kernels of intersecting families, Extremal \(G\)-free induced subgraphs of Kneser graphs, A coloring problem for intersecting vector spaces, Invitation to intersection problems for finite sets, On the arithmetic mean of the size of cross-union families, The structure of large non-trivial \(t\)-intersecting families of finite sets, Erdős-Ko-Rado theorems for set partitions with certain block size, On strengthenings of the intersecting shadow theorem, Matchings and covers in hypergraphs, On the maximum number of distinct intersections in an intersecting family, Maximum degree and diversity in intersecting hypergraphs, Combinatorial analysis. (Matrix problems, choice theory), Maximal \(s\)-wise \(t\)-intersecting families of sets: Kernels, generating sets, and enumeration, Maximum Size Intersecting Families of Bounded Minimum Positive Co-degree, An intersection problem with 6 extremes, Extremal problems concerning Kneser-graphs, A Deza-Frankl type theorem for set partitions, An extension of the Erdős–Ko–Rado Theorem, Non-trivial intersecting families, Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)
Cites Work
