A simple discharging method for forbidden subposet problems

Abstract: The poset

Y_{k + 1, 2}

consists of

k + 2

distinct elements

x_{1}

,

x_{2}

, dots,

x_{k}

,

y_{1}

,

y_{2}

, such that

x_{1} l e x_{2} l e d o t s l e x_{k} l e y_{1}

,~

y_{2}

. The poset

Y'_{k + 1, 2}

is the dual of

Y_{k + 1, 2}

Let

m {L a}^{s h a r p} (n, Y_{k + 1, 2}, Y'_{k + 1, 2})

be the size of the largest family

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

that contains neither

Y_{k + 1, 2}

nor

Y'_{k + 1, 2}

as an induced subposet. Methuku and Tompkins proved that

m {L a}^{s h a r p} (n, Y_{3, 2}, Y'_{3, 2}) = S i g m a (n, 2)

for

n g e 3

and they conjectured the generalization that if

k g e 2

is an integer and

n g e k + 1

, then

m {L a}^{s h a r p} (n, Y_{k + 1, 2}, Y'_{k + 1, 2}) = S i g m a (n, k)

. In this paper, we introduce a simple discharging approach and prove this conjecture.

This page was built for publication: A simple discharging method for forbidden subposet problems