Pages that link to "Item:Q2563163"

The following pages link to A generalization of the Erdős-Ko-Rado theorem on finite set systems (Q2563163):

Displaying 14 items.

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