4 problems

Krivelevich–Sudakov–Szabó conjecture. There exists an absolute constant $c>0$ such that if $\lambda\leq cd^2/n$, then every $(n,d,\lambda)$-graph $G$ on $n\in 3\mathbb{N}$ vertices…

Clemens et al.'s conjecture.

Czygrinow–Kierstead–Molla's conjecture. If $\delta^0(D)\geq 2k$, then $D$ contains $k$ vertex-disjoint directed triangles.

Let $\overrightarrow G$ be a directed graph on $3k$ vertices. Define its minimum semidegree by … A semidegree conjecture for directed triangle factors asserts that if…