scientific article; zbMATH DE number 3621717
From MaRDI portal
Publication:4184835
Cited in
(only showing first 100 items - show all)- Intersecting faces of a simplicial complex via algebraic shifting
- A sharp bound for the product of weights of cross-intersecting families
- On cross \(t\)-intersecting families of sets
- The eigenvalue method for cross t-intersecting families
- Nontrivial \(t\)-intersecting families for vector spaces
- The structure of large non-trivial \(t\)-intersecting families of finite sets
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
- On a conjecture of Tokushige for cross-\(t\)-intersecting families
- Intersections and distinct intersections in cross-intersecting families
- Invitation to intersection problems for finite sets
- Strongly intersecting integer partitions
- Vector sum-intersection theorems
- Regular bipartite graphs and intersecting families
- 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
- Intersecting families of discrete structures are typically trivial
- Extremal problems concerning ordered intersections of sets
- Bounding one-way differences
- Partially symmetric functions are efficiently isomorphism testable
- The Erdős-Ko-Rado theorem for singular linear spaces
- On the Erdős-Ko-Rado theorem and the Bollobás theorem for \(t\)-intersecting families
- Extremal problems concerning Kneser-graphs
- A refined result on cross-intersecting families
- Intersecting k-uniform families containing all the k-subsets of a given set
- The Erdős-Ko-Rado theorem for vector spaces
- A product version of the Erdős-Ko-Rado theorem
- Extremal problems for finite sets and convex hulls---a survey
- On strengthenings of the intersecting shadow theorem
- Nonhomogeneous analytic families of trees
- Large non-trivial \(t\)-intersecting families of signed sets
- Probabilities for Intersecting Systems and Random Subsets of Finite Sets
- Analogues of Milner's theorem for families without long chains and of vector spaces
- 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
- Simple juntas for shifted families
- EKR type inequalities for 4-wise intersecting families
- The EKR property for flag pure simplicial complexes without boundary
- An Erdős-Ko-Rado theorem for integer sequences of given rank
- Improved bounds concerning the maximum degree of intersecting hypergraphs
- An analogue of the Erdős-Ko-Rado theorem for weak compositions
- The Hilton-Milner theorem for attenuated spaces
- Intersecting families, cross-intersecting families, and a proof of a conjecture of Feghali, Johnson and Thomas
- Erdős-Ko-Rado theorems for permutations and set partitions
- Beyond the Erdős matching conjecture
- A product version of the Hilton-Milner-Frankl theorem
- Multiply-intersecting families
- The maximum sum of sizes of cross-intersecting families of subsets of a set
- Cross-intersecting families and primitivity of symmetric systems
- The Erdös-Ko-Rado Theorem for Integer Sequences
- A multiply intersecting Erdős-Ko-Rado theorem -- the principal case
- 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
- An extension of the Erdoes, Ko, Rado theorem to t-designs
- On \(k\)-wise \(L\)-intersecting families for simplicial complexes
- An exact result for (0, 1)-vectors
- Linear independence, a unifying approach to shadow theorems
- An Erdős-Ko-Rado theorem for permutations with fixed number of cycles
- A new short proof of the EKR theorem
- AK-type stability theorems on cross \(t\)-intersecting families
- On \(r\)-cross \(t\)-intersecting families for weak compositions
- The diametric theorem in Hamming spaces---optimal anticodes
- The weighted complete intersection theorem
- Non-trivial intersecting families
- An analogue of the Erdős-Ko-Rado theorem for the distance-regular graphs of bilinear forms
- Exact solution of some Turán-type problems
- A Deza-Frankl type theorem for set partitions
- Short proofs of three results about intersecting systems
- A common generalization to theorems on set systems with L-intersections
- 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
- Families of finite sets satisfying intersection restrictions
- Erdős-Ko-Rado theorems for set partitions with certain block size
- Erd\H os-Ko-Rado type theorems for simplicial complexes via algebraic shifting
- The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities
- Set systems with positive intersection sizes
- A non-trivial intersection theorem for permutations with fixed number of cycles
- Some Erdős-Ko-Rado theorems for injections
- Multiply-intersecting families revisited
- On the bandwidth of the Kneser graph
- r$r$‐Cross t$t$‐intersecting families via necessary intersection points
- Erdös–Ko–Rado Theorem—22 Years Later
- The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem
- The maximum sum of sizes of non-empty cross \(t\)-intersecting families
- Intersecting families without unique shadow
- Stabilities for non-uniform \(t\)-intersecting families
- Extremal \(t\)-intersecting families for direct products
- An improved universal bound for \(t\)-intersecting families
- Non-trivial \(t\)-intersecting families for symplectic polar spaces
- Non-trivial \(r\)-wise intersecting families
- Hypergraph removal lemmas via robust sharp threshold theorems
- A product version of the Hilton-Milner theorem
- On the size of shadow-added intersecting families
- Cross-intersecting non-empty uniform subfamilies of hereditary families
- An intersection problem for codes
- A proof of Frankl–Kupavskii's conjecture on edge‐union condition
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4184835)