An ordered version of the Erdős-Ko-Rado theorem
From MaRDI portal
Publication:754201
DOI10.1016/0097-3165(79)90065-7zbMATH Open0416.05001OpenAlexW2005110213MaRDI QIDQ754201FDOQ754201
Publication date: 1979
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(79)90065-7
Cites Work
Cited In (25)
- Erdős-Ko-Rado theorems of labeled sets
- Large non-trivial \(t\)-intersecting families of signed sets
- The Erdős-Ko-Rado properties of set systems defined by double partitions
- Compression and Erdős-Ko-Rado graphs
- Erdős-Ko-Rado theorems for chordal graphs and trees
- On Chvàtal's conjecture and a conjecture on families of signed sets
- Intersecting families, signed sets, and injection
- The Erdös-Ko-Rado Theorem for Integer Sequences
- Cross-intersecting families of vectors
- A Hilton-Milner-type theorem and an intersection conjecture for signed sets
- The diametric theorem in Hamming spaces---optimal anticodes
- Cross-Intersecting Families of Vectors
- On the star of the family of independent sets in a graph
- Non-trivial \(t\)-intersecting separated families
- Multiple cross-intersecting families of signed sets
- On \(t\)-intersecting families of signed sets and permutations
- An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q)
- More on the Erdős-Ko-Rado theorem for integer sequences
- Geometries and amalgams of J1
- On symmetric intersecting families of vectors
- Integer sequences without singleton intersection
- Some Erdös–Ko–Rado Theorems for Chevalley Groups
- A sharp bound for the product of weights of cross-intersecting families
- Geometries and amalgams of J1
- Strongly intersecting integer partitions
This page was built for publication: An ordered version of the Erdős-Ko-Rado theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q754201)
