Traces Without Maximal Chains
The trace of a family of sets ${\cal A}$ on a set $X$ is ${\cal A}|_X=\{A\cap X:A\in {\cal A}\}$. If ${\cal A}$ is a family of $k$-sets from an $n$-set such that for any $r$-subset $X$ the trace ${\cal A}|_X$ does not contain a maximal chain, then how large can ${\cal A}$ be? Patkós conjectured that, for $n$ sufficiently large, the size of ${\cal A}$ is at most ${n-k+r-1\choose r-1}$. Our aim in this paper is to prove this conjecture.
1986 ◽
Vol 29
(3)
◽
pp. 314-320
◽
2007 ◽
Vol 72
(4)
◽
pp. 1219-1227
◽
1986 ◽
Vol 38
(3)
◽
pp. 619-632
◽
Keyword(s):
1987 ◽
Vol 105
◽
pp. 147-151
◽
Keyword(s):
2014 ◽
Vol 14
(01)
◽
pp. 1450075
◽
Keyword(s):
1997 ◽
Vol 79
(1)
◽
pp. 68-104
◽
Keyword(s):
2012 ◽
Vol 112A
(2)
◽
pp. 101-115
Keyword(s):
Keyword(s):