$Q_2$-free families in the Boolean lattice

Details $Q_2$-free families in the Boolean lattice $Q_2$-free families in the Boolean lattice

2009-12-26

arxiv.org/abs/0912.5039v2

Mathematics

Combinatorics

18 pages, 2 figures

Scientific paper

For a family $\mathcal{F}$ of subsets of [n]=\{1, 2, ..., n} ordered by inclusion, and a partially ordered set P, we say that $\mathcal{F}$ is P-free if it does not contain a subposet isomorphic to P. Let $ex(n, P)$ be the largest size of a P-free family of subsets of [n]. Let $Q_2$ be the poset with distinct elements a, b, c, d, a

Affiliated with

Also associated with

No associations

Rating

$Q_2$-free families in the Boolean lattice 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 $Q_2$-free families in the Boolean lattice, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and $Q_2$-free families in the Boolean lattice will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-567371