A theorem on families of sets

DOI10.1016/0097-3165(72)90030-1zbMath0243.05005OpenAlexW2147282740MaRDI QIDQ2554327

Bernt Lindström

Publication date: 1972

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(72)90030-1

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Helly-type theorems and geometric transversal theory (52A35) Other combinatorial set theory (03E05)

Related Items (10)

Carathéodory, Helly and the others in the max-plus world ⋮ Helge Tverberg is eighty: a personal tribute ⋮ Equicovering subgraphs of graphs and hypergraphs ⋮ Query-competitive algorithms for cheapest set problems under uncertainty ⋮ Polynomial recognition of equal unions in hypergraphs with few vertices of large degree ⋮ Equal coefficients and tolerance in coloured Tverberg partitions ⋮ Nombres de coloration de l'hypergraphe h-parti complet ⋮ Tverberg’s theorem is 50 years old: A survey ⋮ Transversal theory and rank functions ⋮ Remark on a theorem of Lindström

Cites Work

• A Generalization of Radon's Theorem
• Systems of representatives
• Unnamed Item

This page was built for publication: A theorem on families of sets