Four-vertex traces of finite sets

Abstract: Let

[n] = X_{1} c u p X_{2} c u p X_{3}

be a partition with

l f l o o r f r a c n 3 f l o o r l e q | X_{i} | l e q l c e i l f r a c n 3 c e i l

and define

m a t h c a l G = G s u b s e t [n] c o l o n | G c a p X_{i} | l e q 1, 1 l e q i l e q 3

. It is easy to check that the trace

m a t h c a l G_{m i d Y} := G c a p Y c o l o n G i n m a t h c a l G

satisfies

| m a t h c a l G_{m i d Y} | l e q 12

for all 4-sets

Y s u b s e t [n]

. For

n g e q 25

it is proven that whenever

m a t h c a l F s u b s e t 2^{[n]}

satisfies

| m a t h c a l F | > | m a t h c a l G |

then

| m a t h c a l F_{m i d C} | g e q 13

for some

C s u b s e t [n]

,

| C | = 4

. Several further results of a similar flavor are established as well.

Recommendations

Cites Work

This page was built for publication: Four-vertex traces of finite sets