Traces Without Maximal Chains

Details Traces Without Maximal Chains Traces Without Maximal Chains

2010-02-10

arxiv.org/abs/1002.2115v1

Mathematics

Combinatorics

Scientific paper

The trace of a family of sets $\mathcal{A}$ on a set $X$ is $\mathcal{A}|_X=\{A\cap X:A\in \mathcal{A}\}$. If $\mathcal{A}$ is a family of $k$-sets from an $n$-set such that for any $r$-subset $X$ the trace $\mathcal{A}|_X$ does not contain a maximal chain, then how large can $\mathcal{A}$ be? Patk\'os conjectured that, for $n$ sufficiently large, the size of $\mathcal{A}$ is at most $\binom{n-k+r-1}{r-1}$. Our aim in this paper is to prove this conjecture.

Affiliated with

Also associated with

No associations

Rating

Traces Without Maximal Chains does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Traces Without Maximal Chains, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Traces Without Maximal Chains will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-239235