An Erdős-Ko-Rado theorem for restricted signed sets
From MaRDI portal
Publication:2267280
Recommendations
- Erdős-Ko-Rado-type theorems for colored sets
- Intersecting systems of signed sets
- Intersecting generalised permutations
- Multiple cross-intersecting families of signed sets
- Size of the largest antichain in a partition poset
- Counting of even and odd restricted permutations
- On \(t\)-intersecting families of signed sets and permutations
- An Erdős--Ko--Rado theorem for partial permutations
- Tableaux and chains in a new partial order of \(S_ n\)
- Note on signed excedance enumeration of signed permutations.
Cites work
- scientific article; zbMATH DE number 3974960 (Why is no real title available?)
- A Group-Theoretic Setting for Some Intersecting Sperner Families
- A simple proof of the Erdős-Chao Ko-Rado theorem
- An Erdős--Ko--Rado theorem for partial permutations
- An Erdős-Ko-Rado theorem for signed sets
- An Erdős-Ko-Rado theorem for the subcubes of a cube
- Erdös–Ko–Rado Theorem—22 Years Later
- Erdős-Ko-Rado-type theorems for colored sets
- Extensions of the Erdös-Ko-Rado Theorem
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersecting Sperner families and their convex hulls
- Sperner systems consisting of pairs of complementary subsets
Cited in
(4)
This page was built for publication: An Erdős-Ko-Rado theorem for restricted signed sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2267280)
