The complete intersection theorem for systems of finite sets

[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 theorem extreme systems systems of finite sets

Mathematics Subject Classification ID

Extremal set theory (05D05)

Recommendations

Around the complete intersection theorem
Beyond the Erdős-Ko-Rado theorem
Improved Upper Bounds Concerning the Erdős-Ko-Rado Theorem
scientific article; zbMATH DE number 3900758

Cited in

(only showing first 100 items - show all)

The maximum measure of 3-wise \(t\)-intersecting families
Stability for t-intersecting families of permutations
Triangle-intersecting families of graphs
Construction of several classes of maximum codes
The Erdős-Ko-Rado theorem for 2-intersecting families of perfect matchings
A refined result on cross-intersecting families
Intersecting k-uniform families containing all the k-subsets of a given set
An extension of the Erdős–Ko–Rado Theorem
An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges
The Edge-Diametric Theorem in Hamming Spaces
Size of Downsets in the Pushing Order and a Problem of Berlekamp
The \(t\)-intersection problem in the truncated Boolean lattice
Using the existence of \(t\)-designs to prove Erdős-Ko-Rado
A product version of the Erdős-Ko-Rado theorem
Independence numbers and chromatic numbers of some distance graphs
On strengthenings of the intersecting shadow theorem
Cross \(\mathcal L\)-intersecting families on set systems
scientific article; zbMATH DE number 66762 (Why is no real title available?)
Nonhomogeneous analytic families of trees
A structure theorem for almost low-degree functions on the slice
Erdős-Ko-Rado theorems for ovoidal circle geometries and polynomials over finite fields
Set-Theoretic Complete Intersections
Forbidden intersections for codes
Large non-trivial \(t\)-intersecting families of signed sets
Random walks and multiply intersecting families
Hypergraphs with many Kneser colorings
Compression and Erdős-Ko-Rado graphs
On the number of edges in a uniform hypergraph with a range of permitted intersections
Extremal problems under dimension constraints.
Nearly extremal non-trivial cross \(t\)-intersecting families and \(r\)-wise \(t\)-intersecting families
Intersection problems in the q-ary cube
The maximum size of 3-wise t-intersecting families
On symmetric 3-wise intersecting families
Simple juntas for shifted families
EKR type inequalities for 4-wise intersecting families
Intersecting families in \(\begin{pmatrix}[m]\\ \ell\end{pmatrix}\cup\begin{pmatrix}[n]\\ k\end{pmatrix}\)
The EKR property for flag pure simplicial complexes without boundary
New estimates in the problem of the number of edges in a hypergraph with forbidden intersections
More complete intersection theorems
scientific article; zbMATH DE number 4128862 (Why is no real title available?)
On the number of edges of a uniform hypergraph with a range of allowed intersections
On regular 3-wise intersecting families
An analogue of the Erdős-Ko-Rado theorem for weak compositions
All 2-transitive groups have the EKR-module property
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
The maximum sum of sizes of cross-intersecting families of subsets of a set
Intersecting Families are Essentially Contained in Juntas
New results on simplex-clusters in set systems
The structure of maximal non-trivial \(d\)-wise intersecting uniform families with large sizes
A multiply intersecting Erdős-Ko-Rado theorem -- the principal case
Profile vectors in the lattice of subspaces
The maximum product of sizes of cross-intersecting families
A short proof of an Erdős-Ko-Rado theorem for compositions
Erdős-Ko-Rado theorems on the weak Bruhat lattice
A Katona-type proof of an Erdős-Ko-Rado-type theorem
On the Erdős-Ginzburg-Ziv invariant and zero-sum Ramsey number for intersecting families
EKR sets for large \(n\) and \(r\)
On \(k\)-wise \(L\)-intersecting families for simplicial complexes
Combinatorics in the exterior algebra and the Bollobás two families theorem
Linear independence, a unifying approach to shadow theorems
Some bounds for the number of blocks. III.
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
An Erdős-Ko-Rado theorem for permutations with fixed number of cycles
Erdős-Ko-Rado with conditions on the minimum complementary degree
On \(r\)-cross \(t\)-intersecting families for weak compositions
The number of k-intersections of an intersecting family of r-sets
On the structure of subsets of the discrete cube with small edge boundary
The weighted complete intersection theorem
Maximal \(m\)-distance sets containing the representation of the Hamming graph \(H(n, m)\)
A discrete isodiametric result: the Erdős-Ko-Rado theorem for multisets
Maximum hitting for n sufficiently large
The complete nontrivial-intersection theorem for systems of finite sets
The maximum product of weights of cross-intersecting families
On the structure of distance graphs with large chromatic numbers
An unstable hypergraph problem with a unique optimal solution
A Deza-Frankl type theorem for set partitions
Fundamentals of coding type problems
Short proofs of three results about intersecting systems
On t-intersecting families of signed sets and permutations
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
Non-existence of a ternary constant weight (16,5,15;2048) diameter perfect code
On Ramsey numbers for arbitrary sequences of graphs
Disjoint pairs in set systems with restricted intersection
On the arithmetic mean of the size of cross-union families
Circular coloring and Mycielski construction
Erdős-Ko-Rado theorems for set partitions with certain block size
The density of sets avoiding distance 1 in Euclidean space
The maximum sum and the maximum product of sizes of cross-intersecting families
New bounds for the chromatic number of a space with forbidden isosceles triangles
Some results around the Erdős matching conjecture
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
On Mubayi's conjecture and conditionally intersecting sets
Intersection theorems for multisets

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)