Erdős-Ko-Rado-type theorems for colored sets (Q870050)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Erdős-Ko-Rado-type theorems for colored sets |
scientific article; zbMATH DE number 5132835
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Erdős-Ko-Rado-type theorems for colored sets |
scientific article; zbMATH DE number 5132835 |
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
0.8493463397026062
0 references
0.8043776750564575
0 references
0.7834628224372864
0 references
0.7834497690200806
0 references
