The complete intersection theorem for systems of finite sets
From MaRDI portal
Publication:674615
DOI10.1006/EUJC.1995.0092zbMath0869.05066OpenAlexW1987233725WikidataQ105583255 ScholiaQ105583255MaRDI QIDQ674615
Publication date: 5 March 1997
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/5fad950e164ff63b32765bf8f11bb57f0ef2e46f
Related Items (only showing first 100 items - show all)
Combinatorics in the exterior algebra and the Bollobás Two Families Theorem ⋮ The maximum product of sizes of cross-intersecting families ⋮ On symmetric intersecting families of vectors ⋮ The weighted complete intersection theorem ⋮ Intersection theorems under dimension constraints ⋮ On regular 3-wise intersecting families ⋮ Construction of several classes of maximum codes ⋮ Multiply-intersecting families revisited ⋮ On the Erdős–Ginzburg–Ziv invariant and zero-sum Ramsey number for intersecting families ⋮ Non-trivial \(t\)-intersecting families for symplectic polar spaces ⋮ On the number of edges in a uniform hypergraph with a range of permitted intersections ⋮ Approximation by juntas in the symmetric group, and forbidden intersection problems ⋮ Nontrivial t-Intersecting Families for Vector Spaces ⋮ A refined result on cross-intersecting families ⋮ Triangles in intersecting families ⋮ Cross-intersecting non-empty uniform subfamilies of hereditary families ⋮ Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs ⋮ r$r$‐Cross t$t$‐intersecting families via necessary intersection points ⋮ Integer sequences without singleton intersection ⋮ On t-Intersecting Hypergraphs with Minimum Positive Codegrees ⋮ Independence numbers of Johnson-type graphs ⋮ The maximum product of weights of cross-intersecting families ⋮ A family of diameter perfect constant-weight codes from Steiner systems ⋮ Forbidden intersections for codes ⋮ 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 ⋮ Triangle-intersecting families of graphs ⋮ Intersection theorems for \((- 1, 0, 1)\)-vectors ⋮ Non-trivial \(t\)-intersecting separated families ⋮ A note on the maximum product-size of non-trivial cross \(t\)-intersecting families ⋮ Reflect-push methods. Part I: Two dimensional techniques ⋮ KKL's influence on me ⋮ Mathematics of computation through the lens of linear equations and lattices ⋮ Strong stability of 3-wise \(t\)-intersecting families ⋮ The maximum measure of 3-wise \(t\)-intersecting families ⋮ On symmetric 3-wise intersecting families ⋮ A Diametric Theorem in ${\mathbb Z}^n_m$ for Lee and Related Distances ⋮ 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 ⋮ Intersecting Families are Essentially Contained in Juntas ⋮ On the structure of subsets of the discrete cube with small edge boundary ⋮ A new short proof of a theorem of Ahlswede and Khachatrian ⋮ Intersecting families of permutations ⋮ An Unstable Hypergraph Problem with a Unique Optimal Solution ⋮ Unnamed Item ⋮ Spread approximations for forbidden intersections problems ⋮ On Mubayi's Conjecture and Conditionally Intersecting Sets ⋮ The maximum sum and the maximum product of sizes of cross-intersecting families ⋮ Simple juntas for shifted families ⋮ Around Borsuk's hypothesis ⋮ On large intersecting subfamilies of uniform setfamilies ⋮ Fundamentals of coding type problems ⋮ Nonhomogeneous analytic families of trees ⋮ Unnamed Item ⋮ A cross‐intersection theorem for subsets of a set ⋮ A Katona-type proof of an Erdős-Ko-Rado-type theorem ⋮ Partially Symmetric Functions Are Efficiently Isomorphism Testable ⋮ Extremal problems under dimension constraints ⋮ The Edge-Diametric Theorem in Hamming Spaces ⋮ Size of Downsets in the Pushing Order and a Problem of Berlekamp ⋮ An extension of the Erdős–Ko–Rado Theorem ⋮ Projectivity and independent sets in powers of graphs ⋮ New lower bounds for the chromatic number of a space with forbidden isosceles triangles ⋮ Erdős-Ko-Rado theorems for ovoidal circle geometries and polynomials over finite fields ⋮ Intersection problems in the \(q\)-ary cube ⋮ More complete intersection theorems ⋮ Intersecting families in \(\begin{pmatrix}[m\\ \ell\end{pmatrix}\cup\begin{pmatrix}[n]\\ k\end{pmatrix}\)] ⋮ EKR sets for large \(n\) and \(r\) ⋮ 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 note on a conjecture of bene Watts-Norin-Yepremyan for Lagrangian ⋮ On Ramsey numbers for arbitrary sequences of graphs ⋮ Pairwise intersections and forbidden configurations ⋮ Non-existence of a ternary constant weight \((16,5,15;2048)\) diameter perfect code ⋮ The maximum size of 3-wise \(t\)-intersecting families ⋮ 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 ⋮ Diversity of uniform intersecting families ⋮ A tale of stars and cliques ⋮ EKR type inequalities for 4-wise intersecting families ⋮ On the structure of distance graphs with large chromatic numbers ⋮ An improved universal bound for \(t\)-intersecting families ⋮ Large \(\{0,1,\ldots,t\}\)-cliques in dual polar graphs ⋮ Deterministic quantum non-locality and graph colorings ⋮ Set systems related to a house allocation problem ⋮ An analogue of the Erdős-Ko-Rado theorem for weak compositions ⋮ 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 ⋮ On the maximal number of edges in a uniform hypergraph with one forbidden intersection ⋮ An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges ⋮ An Erdős-Ko-Rado theorem for permutations with fixed number of cycles ⋮ On the number of edges of a uniform hypergraph with a range of allowed intersections ⋮ Intersection theorems for multisets ⋮ Hypergraphs with many Kneser colorings ⋮ A non-trivial intersection theorem for permutations with fixed number of cycles ⋮ Maximal 2-distance sets containing the regular simplex
This page was built for publication: The complete intersection theorem for systems of finite sets
