An intersection theorem for weighted sets

DOI10.1016/S0012-365X(00)00267-3zbMath1016.05068OpenAlexW2133707352MaRDI QIDQ5937926

No author found.

Publication date: 25 August 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00267-3

zbMATH Keywords

extremal set problemintersecting familygenerating setscolored setsweighted sets

Mathematics Subject Classification ID

Extremal set theory (05D05)

Related Items (7)

On the Holroyd-Talbot conjecture for sparse graphs ⋮ A sharp bound for the product of weights of cross-intersecting families ⋮ Multiple cross-intersecting families of signed sets ⋮ An Erdős-Ko-Rado theorem for unions of length 2 paths ⋮ Intersecting families, signed sets, and injection ⋮ Strongly intersecting integer partitions ⋮ The Erdős-Ko-Rado properties of set systems defined by double partitions

This page was built for publication: An intersection theorem for weighted sets