The complete intersection theorem for systems of finite sets

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)

On t-intersecting families of signed sets and permutations
Profile vectors in the lattice of subspaces
Fractional set systems with few disjoint pairs
Extremal problems under dimension constraints.
More complete intersection theorems
Diversity of uniform intersecting families
A tale of stars and cliques
Large $\{0,1,\ldots,t\}$-cliques in dual polar graphs
Non-trivially intersecting multi-part families
Intersecting families, cross-intersecting families, and a proof of a conjecture of Feghali, Johnson and Thomas
On a biased edge isoperimetric inequality for the discrete cube
A generalization of Erdős' matching conjecture
Erdős-Ko-Rado with conditions on the minimum complementary degree
Random walks and multiply intersecting families
Compression and Erdős-Ko-Rado graphs
The number of k-intersections of an intersecting family of r-sets
The $t$-intersection problem in the truncated Boolean lattice
Weighted 3-wise 2-intersecting families
The complete nontrivial-intersection theorem for systems of finite sets
All 2-transitive groups have the EKR-module property
Disjoint pairs in set systems with restricted intersection
Erdős-Ko-Rado theorems on the weak Bruhat lattice
Beyond the Erdős matching conjecture
On the arithmetic mean of the size of cross-union families
The structure of large non-trivial $t$-intersecting families of finite sets
On strengthenings of the intersecting shadow theorem
The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem
Erdős-Ko-Rado theorems for ovoidal circle geometries and polynomials over finite fields
A note on a conjecture of Bene Watts-Norin-Yepremyan for Lagrangian
On Ramsey numbers for arbitrary sequences of graphs
The maximum sum of sizes of cross-intersecting families of subsets of a set
Extremal t-intersecting families for direct products
An improved universal bound for $t$-intersecting families
Set systems related to a house allocation problem
Cross-intersecting subfamilies of levels of hereditary families
On the number of edges of a uniform hypergraph with a range of allowed intersections
Maximal 2-distance sets containing the regular simplex
A structure theorem for almost low-degree functions on the slice
The Erdős-Ko-Rado theorem for 2-intersecting families of perfect matchings
New results on simplex-clusters in set systems
The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
On dividing sets into parts of smaller diameter
New estimates in the problem of the number of edges in a hypergraph with forbidden intersections
Stability versions of Erdős-Ko-Rado type theorems via isoperimetry
Erdős-Ko-Rado theorems for set partitions with certain block size
The EKR property for flag pure simplicial complexes without boundary
Classification of maximum hittings by large families
Using the existence of $t$-designs to prove Erdős-Ko-Rado
On $r$-cross $t$-intersecting families for weak compositions
A Deza-Frankl type theorem for set partitions
A discrete isodiametric result: the Erdős-Ko-Rado theorem for multisets
The density of sets avoiding distance 1 in Euclidean space
New lower bounds for the chromatic number of a space with forbidden isosceles triangles
The maximum product of sizes of cross-intersecting families
The weighted complete intersection theorem
Intersection theorems under dimension constraints
Systems of nonempty intersection theorems with applications
Multiply-intersecting families revisited
On the number of edges in a uniform hypergraph with a range of permitted intersections
Cross-intersecting non-empty uniform subfamilies of hereditary families
Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
Triangle-intersecting families of graphs
Set systems with restricted $k$-wise $\mathcal{L}$-intersections modulo a prime number
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
A new short proof of a theorem of Ahlswede and Khachatrian
The maximum sum and the maximum product of sizes of cross-intersecting families
Around Borsuk's hypothesis
A Katona-type proof of an Erdős-Ko-Rado-type theorem
Independence numbers and chromatic numbers of some distance graphs
Non-trivial t-intersecting families for symplectic polar spaces
Approximation by juntas in the symmetric group, and forbidden intersection problems
The maximum measure of 3-wise t-intersecting families
Intersection problems in the q-ary cube
Complete intersection problems for finite permutations
EKR sets for large $n$ and $r$
The maximum product of weights of cross-intersecting families
The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities
Some bounds for the number of blocks. III.
On symmetric 3-wise intersecting families
Linear independence, a unifying approach to shadow theorems
Projectivity and independent sets in powers of graphs
On regular 3-wise intersecting families
On the Erdős-Ginzburg-Ziv invariant and zero-sum Ramsey number for intersecting families
Non-existence of a ternary constant weight (16,5,15;2048) diameter perfect code
Intersection Theorems for Systems of Sets
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
A Diametric Theorem in ${\mathbb Z}^n_m$ for Lee and Related Distances
Intersecting Families are Essentially Contained in Juntas
Fundamentals of coding type problems
Set-Theoretic Complete Intersections
The eigenvalue method for cross t-intersecting families
Deterministic quantum non-locality and graph colorings
An analogue of the Erdős-Ko-Rado theorem for weak compositions
Intersecting k-uniform families containing all the k-subsets of a given set
A short proof of an Erdős-Ko-Rado theorem for compositions
scientific article; zbMATH DE number 66762 (Why is no real title available?)
An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges

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)