Erdős-Ko-Rado-type theorems for colored sets (Q870050): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 16:26, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Erdős-Ko-Rado-type theorems for colored sets |
scientific article |
Statements
Erdős-Ko-Rado-type theorems for colored sets (English)
0 references
12 March 2007
0 references
Summary: An Erdős-Ko-Rado-type theorem was established by Bollobás and Leader for \(q\)-signed sets and by Ku and Leader for partial permutations. In this paper, we establish an LYM-type inequality for partial permutations, and prove Ku and Leader's conjecture on maximal \(k\)-uniform intersecting families of partial permutations. Similar results on general colored sets are presented.
0 references
LYM-type inequality
0 references
partial permutations
0 references