L. Post

collaborators

2 papers

math.CO2026

Counting cliques in graphs with small independence number

Logan Post

We prove that for all fixed $k \geq 4$ , any $N$ vertex graph with no independent set of size $n$ and $N \geq I^c ◯ (n^{k - 1} / lo g^{k - 2} n)$ contains at least $$ Î©\bigg(\binom Nk \Big(\fra…

math.CO2026

Hypergraph Ramsey numbers with quasipolynomial growth rate

Xiaoyu He, Jiaxi Nie, Logan Post +1

For a 3-uniform hypergraph (3-graph) $F$ , let $r (F, n)$ be the smallest $N$ such that any $N$ -vertex $F$ -free 3-graph has an independent set of size $n$ . We construct a $3$ -graph $H…