The complete nontrivial-intersection theorem for systems of finite sets
From MaRDI portal
Publication:1924241
DOI10.1006/jcta.1996.0092zbMath0861.05058OpenAlexW2089616955WikidataQ105583193 ScholiaQ105583193MaRDI QIDQ1924241
Publication date: 14 October 1996
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcta.1996.0092
Related Items (58)
Intersection problems in the \(q\)-ary cube ⋮ The weighted complete intersection theorem ⋮ On chromatic numbers of close-to-Kneser distance graphs ⋮ Intersection theorems under dimension constraints ⋮ On Ramsey numbers for arbitrary sequences of graphs ⋮ Upper bounds for \(s\)-distance sets and equiangular lines ⋮ Multiply-intersecting families revisited ⋮ On chromatic numbers of nearly Kneser distance graphs ⋮ On the Erdős–Ginzburg–Ziv invariant and zero-sum Ramsey number for intersecting families ⋮ Non-trivial \(t\)-intersecting families for symplectic polar spaces ⋮ Nontrivial t-Intersecting Families for Vector Spaces ⋮ Intersecting \(k\)-uniform families containing all the \(k\)-subsets of a given set ⋮ Stability for \(t\)-intersecting families of permutations ⋮ Generalized Turán results for intersecting cliques ⋮ An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges ⋮ Triangles in intersecting families ⋮ On the number of edges of a uniform hypergraph with a range of allowed intersections ⋮ Intersection theorems for multisets ⋮ The maximum measure of non-trivial 3-wise intersecting families ⋮ A non-trivial intersection theorem for permutations with fixed number of cycles ⋮ A product version of the Hilton-Milner 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 ⋮ Non-trivial 3-wise intersecting uniform families ⋮ Improved bounds on the maximum diversity of intersecting families ⋮ New bounds for the chromatic number of a space with forbidden isosceles triangles ⋮ On independence numbers of distance graphs with vertices in \(\{-1,0,1\}^n\): estimates, conjectures, and applications to the Nelson-Erdős-hadwiger problem and the borsuk problem ⋮ Improvements of the Frankl-Rödl theorem on the number of edges of a hypergraph with forbidden intersections, and their consequences in the problem of finding the chromatic number of a space with forbidden equilateral triangle ⋮ Brace-Daykin type inequalities for intersecting families ⋮ The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture ⋮ Size of downsets in the pushing order and a problem of Berlekamp ⋮ 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 multiply intersecting Erdős-Ko-Rado theorem -- the principal case ⋮ Intersecting families of discrete structures are typically trivial ⋮ New estimates in the problem of the number of edges in a hypergraph with forbidden intersections ⋮ On Mubayi's Conjecture and Conditionally Intersecting Sets ⋮ Stability versions of Erdős-Ko-Rado type theorems via isoperimetry ⋮ Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems ⋮ Invitation to intersection problems for finite sets ⋮ Around Borsuk's hypothesis ⋮ The structure of large non-trivial \(t\)-intersecting families of finite sets ⋮ Tight bounds for Katona's shadow intersection theorem ⋮ On strengthenings of the intersecting shadow theorem ⋮ The diametric theorem in Hamming spaces---optimal anticodes ⋮ The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton–Milner family ⋮ Using the existence of \(t\)-designs to prove Erdős-Ko-Rado ⋮ Maximal \(s\)-wise \(t\)-intersecting families of sets: Kernels, generating sets, and enumeration ⋮ Size of Downsets in the Pushing Order and a Problem of Berlekamp ⋮ An extension of the Erdős–Ko–Rado Theorem ⋮ Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\) ⋮ Independence numbers and chromatic numbers of some distance graphs ⋮ New lower bounds for the chromatic number of a space with forbidden isosceles triangles ⋮ Optimal tristance anticodes in certain graphs
This page was built for publication: The complete nontrivial-intersection theorem for systems of finite sets
