On the representing number of intersecting families

DOI10.1007/BF01200473zbMath0629.05006OpenAlexW2160174869WikidataQ105659295 ScholiaQ105659295MaRDI QIDQ1093635

Martin Aigner, Daniel Grieser

Publication date: 1987

Published in: Archiv der Mathematik (Search for Journal in Brave)

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

zbMATH Keywords

family of subsetsextremal set theoryintersectionfamily of sets

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Permutations, words, matrices (05A05) Other combinatorial set theory (03E05)

Related Items (1)

Matchings and covers in hypergraphs

Cites Work

• Unnamed Item
• The exact bound in the Erdős-Ko-Rado theorem
• Erdős-Ko-Rado from Kruskal-Katona
• A simple proof of the Erdős-Chao Ko-Rado theorem
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersection Theorems for Systems of Sets
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On intersecting families of finite sets

This page was built for publication: On the representing number of intersecting families