Introduces weak and strong poset Ramsey-Turán numbers for t-chains in the Boolean lattice and proves equality to (k-1)(l-1) for chains when t=1 plus Theta(n^t) growth for non-chains.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Ramsey-Tur\'{a}n theory for partially-ordered sets
Introduces weak and strong poset Ramsey-Turán numbers for t-chains in the Boolean lattice and proves equality to (k-1)(l-1) for chains when t=1 plus Theta(n^t) growth for non-chains.