Erdős-Ko-Rado and Hilton-Milner type theorems for intersecting chains in posets

DOI10.1007/s004930070029zbMath0949.05081OpenAlexW2010096242MaRDI QIDQ1586333

Péter L. Erdős, László A. Székely, Seress, Ákos

Publication date: 13 November 2000

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004930070029

zbMATH Keywords

extremal set theorykernel methodErdős-Ko-Rado type theoremfamilies of intersecting chainsHilton-Milnor type theoremintersecting \(k\)-chainsshift method

Mathematics Subject Classification ID

Partial orders, general (06A06) Extremal set theory (05D05)

Related Items (4)

Maximum hitting of a set by compressed intersecting families ⋮ Partial covering arrays and a generalized Erdös-Ko-Rado property ⋮ Graphs with the Erdős-Ko-Rado property ⋮ The Erdős-Ko-Rado properties of set systems defined by double partitions

This page was built for publication: Erdős-Ko-Rado and Hilton-Milner type theorems for intersecting chains in posets