Paper Info
Title
Partial Shadows of Set Systems.
Abstract
The shadow of a system of sets is all sets which can be obtained by taking a set in the original system, and removing a single element. The Kruskal-Katona theorem tells us the minimum possible size of the shadow of A, if A consists of m r-element sets. In this paper, we ask questions and make conjectures about the minimum possible size of a partial shadow for A, which contains most sets in the shadow of A. For example, if B is a family of sets containing all but one set in the shadow of each set of A, how large must B be?
Year
DOI
Venue
2015
10.1017/S0963548314000790
COMBINATORICS PROBABILITY & COMPUTING
Field
DocType
Volume
Shadow,Family of sets,Discrete mathematics,Combinatorics,Mathematics
Journal
24
Issue
ISSN
Citations 
5
0963-5483
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
Béla Bollobás12696474.16
Tom Eccles2175.77