4 problems

Dudek–La Fleur–Mubayi–Rödl's conjecture. The size-Ramsey number of tight paths is linear in the number of vertices $n$, that is, for each fixed $k$, there is a constant $C_k$ such…

Let $H$ be an $n$-vertex $3$-graph, and let $[?]$ denote its minimum codegree, the minimum number of common neighbours over all pairs of vertices. A collection of tight paths is ve…

For integers $2\le k < s < n$ and $2\le t\le {s\choose k}$, let $r_k(s,t;P_n)$ be the minimum $N$ such that every red/blue coloring of the $k$-sets of $[N]$ contains a monochromati…

Extremal conjecture for tight paths and cycles. For any $\ell$, every $n$-vertex $k$-graph with more than