A generalization of the Erdős-Ko-Rado theorem on finite set systems

DOI10.1016/0097-3165(73)90085-XzbMath0269.05003OpenAlexW1994475321MaRDI QIDQ2563163

Yanyan Li

Publication date: 1973

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(73)90085-x

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial inequalities (05A20) Other combinatorial set theory (03E05)

Related Items (14)

An Erdős-Ko-Rado theorem for permutations with fixed number of cycles ⋮ Intersection theorems for multisets ⋮ Maximum hitting of a set by compressed intersecting families ⋮ A general framework for discovering and proving theorems of the Erdős- Ko-Rado type ⋮ Some Erdős-Ko-Rado theorems for injections ⋮ Erdös–Ko–Rado Theorem—22 Years Later ⋮ The Chromatic Number of Kneser Hypergraphs ⋮ Families of finite sets satisfying intersection restrictions ⋮ The number of \(k\)-intersections of an intersecting family of \(r\)-sets ⋮ The Erdős-Ko-Rado properties of set systems defined by double partitions ⋮ On \(r\)-cross \(t\)-intersecting families for weak compositions ⋮ Extremal problems concerning Kneser-graphs ⋮ A discrete isodiametric result: the Erdős-Ko-Rado theorem for multisets ⋮ Largest size and union of Helly families

Cites Work

• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Families of Non-disjoint subsets

This page was built for publication: A generalization of the Erdős-Ko-Rado theorem on finite set systems