The complete intersection theorem for systems of finite sets
From MaRDI portal
Publication:674615
Recommendations
Cited in
(only showing first 100 items - show all)- The maximum sum of sizes of cross-intersecting families of subsets of a set
- The maximum size of 3-wise \(t\)-intersecting families
- Disjoint pairs in set systems with restricted intersection
- Triangles in \(r\)-wise \(t\)-intersecting families
- Extremal problems under dimension constraints
- Intersection theorems under dimension constraints
- Erdős-Ko-Rado with conditions on the minimum complementary degree
- Integer sequences without singleton intersection
- The \(t\)-intersection problem in the truncated Boolean lattice
- EKR type inequalities for 4-wise intersecting families
- Fractional set systems with few disjoint pairs
- On dividing sets into parts of smaller diameter
- Triangles in intersecting families
- A refined result on cross-intersecting families
- Size of downsets in the pushing order and a problem of Berlekamp
- The edge-diametric theorem in Hamming spaces
- On the Erdős-Ginzburg-Ziv invariant and zero-sum Ramsey number for intersecting families
- On the structure of subsets of the discrete cube with small edge boundary
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
- On the structure of distance graphs with large chromatic numbers
- Combinatorics in the exterior algebra and the Bollobás two families theorem
- Erdős-Ko-Rado theorems for set partitions with certain block size
- On the number of edges in a uniform hypergraph with a range of permitted intersections
- scientific article; zbMATH DE number 4128862 (Why is no real title available?)
- On strengthenings of the intersecting shadow theorem
- The Erdős-Ko-Rado theorem for 2-intersecting families of perfect matchings
- On Ramsey numbers for arbitrary sequences of graphs
- Intersection theorems for multisets
- A non-trivial intersection theorem for permutations with fixed number of cycles
- Large \(\{0,1,\ldots,t\}\)-cliques in dual polar graphs
- Construction of several classes of maximum codes
- The maximum measure of 3-wise \(t\)-intersecting families
- Maximal \(m\)-distance sets containing the representation of the Hamming graph \(H(n, m)\)
- Set systems with restricted \(k\)-wise \(\mathcal{L}\)-intersections modulo a prime number
- On diversity of certain \(t\)-intersecting families
- A tale of stars and cliques
- On symmetric 3-wise intersecting families
- On a biased edge isoperimetric inequality for the discrete cube
- A multiply intersecting Erdős-Ko-Rado theorem -- the principal case
- The maximum product of sizes of cross-intersecting families
- Nontrivial \(t\)-intersecting families for vector spaces
- On regular 3-wise intersecting families
- Vector sum-intersection theorems
- Diversity of uniform intersecting families
- r$r$‐Cross t$t$‐intersecting families via necessary intersection points
- Stability versions of Erdős-Ko-Rado type theorems via isoperimetry
- Cross \(\mathcal L\)-intersecting families on set systems
- Random walks and multiply intersecting families
- Non-trivially intersecting multi-part families
- On the number of edges of a uniform hypergraph with a range of allowed intersections
- Approximation by juntas in the symmetric group, and forbidden intersection problems
- An Erdős-Ko-Rado theorem for permutations with fixed number of cycles
- New bounds for the chromatic number of a space with forbidden isosceles triangles
- Systems of nonempty intersection theorems with applications
- Intersection problems in the \(q\)-ary cube
- Intersecting families of permutations
- Stability for \(t\)-intersecting families of permutations
- EKR sets for large \(n\) and \(r\)
- A Katona-type proof of an Erdős-Ko-Rado-type theorem
- Weighted 3-wise 2-intersecting families
- Cross-intersecting Erdős-Ko-Rado sets in finite classical polar spaces
- On the stability of the Erdös-Ko-Rado theorem
- New lower bounds for the chromatic number of a space with forbidden isosceles triangles
- 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
- A short proof of an Erdős-Ko-Rado theorem for compositions
- Intersection theorem for finite permutations
- A cross‐intersection theorem for subsets of a set
- An Erdős-Ko-Rado theorem for cross \(t\)-intersecting families
- The minimum number of disjoint pairs in set systems and related problems
- Intersecting Families are Essentially Contained in Juntas
- Compression and Erdős-Ko-Rado graphs
- New estimates in the problem of the number of edges in a hypergraph with forbidden intersections
- Multiply-intersecting families revisited
- On the measure of intersecting families, uniqueness and stability
- Maximum hitting for \(n\) sufficiently large
- The structure of large non-trivial \(t\)-intersecting families of finite sets
- Hypergraphs with many Kneser colorings
- Intersecting \(k\)-uniform families containing all the \(k\)-subsets of a given set
- The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities
- Intersecting families, cross-intersecting families, and a proof of a conjecture of Feghali, Johnson and Thomas
- Circular coloring and Mycielski construction
- Set systems without a simplex or a cluster
- An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges
- A generalization of Erdős' matching conjecture
- Intersecting families in \(\begin{pmatrix}[m]\\ \ell\end{pmatrix}\cup\begin{pmatrix}[n]\\ k\end{pmatrix}\)
- Invitation to intersection problems for finite sets
- Strongly intersecting integer partitions
- Beyond the Erdős matching conjecture
- An analogue of the Erdős-Ko-Rado theorem for weak compositions
- The eigenvalue method for cross \(t\)-intersecting families
- Pairwise intersections and forbidden configurations
- On \(r\)-cross \(t\)-intersecting families for weak compositions
- The maximum sum and the maximum product of sizes of cross-intersecting families
- The density of sets avoiding distance 1 in Euclidean space
- A product version of the Erdős-Ko-Rado theorem
- Intersection Theorems for Systems of Sets
- Some Erdős-Ko-Rado theorems for injections
- 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
- Deterministic quantum non-locality and graph colorings
- A Deza-Frankl type theorem for set partitions
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)