3 problems

Let $C_4$ denote the quadrilateral. An $n$-vertex graph is a union of edge-disjoint quadrilaterals if its edges are partitioned into copies of $C_4$. Solymosi's quadrilateral conje…

Let $H$ be a graph with exponent $\alpha$, meaning that its Turán number satisfies … A graph is said to have the unique-copy property for $H$ if every edge lies in exactly one copy…

Sudakov–Szabó–Vu conjecture. The bound $\beta\leq c p^{t-1}n$ is the correct condition for finding copies of $K_t$ in a $(p,\beta)$-jumbled graph.