A proof and generalizations of the Erdős-Ko-Rado theorem using the method of linearly independent polynomials
From MaRDI portal
(Redirected from Publication:3424883)
Recommendations
Cited in
(12)- On intersecting families of independent sets in trees
- The Erdős-Ko-Rado theorem for 2-pointwise and 2-setwise intersecting permutations
- Partition critical hypergraphs
- The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities
- Partial covering arrays and a generalized Erdős-Ko-Rado property
- Some new bounds on partition critical hypergraphs
- A new short proof of the EKR theorem
- An algebraic groups perspective on Erdős–Ko–Rado
- On \(k\)-wise \(L\)-intersecting families for simplicial complexes
- The maximum of the product of nontrivial cross-intersecting 3-graphs
- Maximal intersecting families revisited
- A result for hemi-bundled cross-intersecting families
This page was built for publication: A proof and generalizations of the Erdős-Ko-Rado theorem using the method of linearly independent polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3424883)