The complete intersection theorem for systems of finite sets
From MaRDI portal
Publication:674615
DOI10.1006/EUJC.1995.0092zbMATH Open0869.05066OpenAlexW1987233725WikidataQ105583255 ScholiaQ105583255MaRDI QIDQ674615FDOQ674615
Rudolf Ahlswede, Levon H. Khachatrian
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
Recommendations
[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Erd%EF%BF%BD%EF%BF%BDs-Ko-Rado+theorem&go=Go Erd��s-Ko-Rado theorem]intersection theoremextreme systemssystems of finite sets
Cited In (only showing first 100 items - show all)
- Stability for \(t\)-intersecting families of permutations
- An Unstable Hypergraph Problem with a Unique Optimal Solution
- A refined result on cross-intersecting families
- Intersecting \(k\)-uniform families containing all the \(k\)-subsets of a given set
- An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges
- A product version of the Erdős-Ko-Rado theorem
- Set-Theoretic Complete Intersections
- Independence numbers and chromatic numbers of some distance graphs
- Compression and Erdős-Ko-Rado graphs
- Hypergraphs with many Kneser colorings
- Extremal problems under dimension constraints.
- Intersection problems in the \(q\)-ary cube
- New estimates in the problem of the number of edges in a hypergraph with forbidden intersections
- Intersecting families in \(\begin{pmatrix}[m]\\ \ell\end{pmatrix}\cup\begin{pmatrix}[n]\\ k\end{pmatrix}\)
- More complete intersection theorems
- New lower bounds for the chromatic number of a space with forbidden isosceles triangles
- Intersecting families, cross-intersecting families, and a proof of a conjecture of Feghali, Johnson and Thomas
- A generalization of Erdős' matching conjecture
- Beyond the Erdős matching conjecture
- An analogue of the Erdős-Ko-Rado theorem for weak compositions
- Intersecting Families are Essentially Contained in Juntas
- Profile vectors in the lattice of subspaces
- A Katona-type proof of an Erdős-Ko-Rado-type theorem
- A short proof of an Erdős-Ko-Rado theorem for compositions
- EKR sets for large \(n\) and \(r\)
- 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
- Linear independence, a unifying approach to shadow theorems
- Some bounds for the number of blocks. III.
- An Erdős-Ko-Rado theorem for permutations with fixed number of cycles
- On \(r\)-cross \(t\)-intersecting families for weak compositions
- The weighted complete intersection theorem
- The number of \(k\)-intersections of an intersecting family of \(r\)-sets
- A discrete isodiametric result: the Erdős-Ko-Rado theorem for multisets
- Maximum hitting for \(n\) sufficiently large
- The maximum product of weights of cross-intersecting families
- The complete nontrivial-intersection theorem for systems of finite sets
- A Deza-Frankl type theorem for set partitions
- On \(t\)-intersecting families of signed sets and permutations
- Non-existence of a ternary constant weight \((16,5,15;2048)\) diameter perfect code
- Circular coloring and Mycielski construction
- The maximum sum and the maximum product of sizes of cross-intersecting families
- The density of sets avoiding distance 1 in Euclidean space
- New bounds for the chromatic number of a space with forbidden isosceles triangles
- Multiply-intersecting families revisited
- The minimum number of disjoint pairs in set systems and related problems
- The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities
- Set systems without a simplex or a cluster
- Some Erdős-Ko-Rado theorems for injections
- Around Borsuk's hypothesis
- Pairwise intersections and forbidden configurations
- On the measure of intersecting families, uniqueness and stability
- An Erdős-Ko-Rado theorem for cross \(t\)-intersecting families
- On the maximal number of edges in a uniform hypergraph with one forbidden intersection
- Systems of nonempty intersection theorems with applications
- On the stability of the Erdös-Ko-Rado theorem
- A cross‐intersection theorem for subsets of a set
- Projectivity and independent sets in powers of graphs
- Weighted 3-wise 2-intersecting families
- Intersection Theorems for Systems of Sets
- Union-intersecting set systems
- A sharp bound for the product of weights of cross-intersecting families
- The structure of large non-trivial \(t\)-intersecting families of finite sets
- The eigenvalue method for cross \(t\)-intersecting families
- Invitation to intersection problems for finite sets
- Strongly intersecting integer partitions
- On large intersecting subfamilies of uniform setfamilies
- Intersecting families of permutations
- An intersection theorem for systems of finite sets
- Around the complete intersection theorem
- On the maximum number of edges in a hypergraph with given matching number
- Towards extending the Ahlswede-Khachatrian theorem to cross \(t\)-intersecting families
- Cross-intersecting Erdős-Ko-Rado sets in finite classical polar spaces
- 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
- Deterministic quantum non-locality and graph colorings
- Complete intersection problems for finite permutations
- Intersection theorem for finite permutations
- Triangle-intersecting families of graphs
- The Erdős-Ko-Rado theorem for 2-intersecting families of perfect matchings
- The \(t\)-intersection problem in the truncated Boolean lattice
- On strengthenings of the intersecting shadow theorem
- Cross \(\mathcal L\)-intersecting families on set systems
- Random walks and multiply intersecting families
- On the number of edges in a uniform hypergraph with a range of permitted intersections
- On symmetric 3-wise intersecting families
- The maximum size of 3-wise \(t\)-intersecting families
- EKR type inequalities for 4-wise intersecting families
- Title not available (Why is that?)
- On regular 3-wise intersecting families
- On the number of edges of a uniform hypergraph with a range of allowed intersections
- All 2-transitive groups have the EKR-module property
- The maximum sum of sizes of cross-intersecting families of subsets of a set
- A multiply intersecting Erdős-Ko-Rado theorem -- the principal case
- The maximum product of sizes of cross-intersecting families
- Title not available (Why is that?)
- Erdős-Ko-Rado with conditions on the minimum complementary degree
- On the structure of subsets of the discrete cube with small edge boundary
- Maximal \(m\)-distance sets containing the representation of the Hamming graph \(H(n, m)\)
- Nontrivial t-Intersecting Families for Vector Spaces
- On the structure of distance graphs with large chromatic numbers
- On Ramsey numbers for arbitrary sequences of graphs
This page was built for publication: The complete intersection theorem for systems of finite sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q674615)
