Maximum hitting of a set by compressed intersecting families
type: Item
instance of: scholarly article
title: Maximum hitting of a set by compressed intersecting families
zbMATH Open document ID: 1233.05193
author: Peter Borg
published in: Graphs and Combinatorics
publication date: 2012-01-24T00:00:00Z
Mathematics Subject Classification ID: 05D05
zbMATH DE Number: 5999872
zbMATH Keywords: Erdős-Ko-Rado Theorem
zbMATH Keywords: Intersecting family
zbMATH Keywords: Compressed family
MaRDI profile type: Publication
full work available at URL: s00373-010-1001-2
OpenAlex ID: W2134230490
cites work: Erdős-Ko-Rado from Kruskal-Katona
cites work: Erdös–Ko–Rado Theorem—22 Years Later
cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
cites work: Intersection Theorems for Systems of Sets
cites work: Erdős-Ko-Rado and Hilton-Milner type theorems for intersecting chains in posets
cites work: On intersecting families of finite sets
cites work: Q3770569
cites work: Non-trivial intersecting families
cites work: Some best possible inequalities concerning cross-intersecting families
cites work: A generalization of the Erdős-Ko-Rado theorem on finite set systems
cites work: SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
cites work: Graphs with the Erdős-Ko-Rado property
cites work: A simple proof of the Erdős-Chao Ko-Rado theorem
cites work: Q4071752
cites work: Q5726070
DOI: 10.1007/S00373-010-1001-2
description: scientific article; zbMATH DE number 5999872