25 problems

Let $P_k$ be the path on $k$ vertices, let $K_s$ be the complete graph on $s$ vertices, and let $sat(n,H)$ denote the minimum number of edges in an $H$-saturated graph on $n$ verti…

Packing–saturation conjecture.

Separation conjecture. For any $r=r(k)\geq 3$,

Let $C_k$ denote the cycle graph on $k$ vertices, and let $\mathrm{sat}(n,C_k)$ be its saturation number. Füredi–Kim conjecture. There exists a constant $k_0$ such that … holds for…

Wheel saturation recurrence. For every integer $k\geq 4$, there exists a constant $N_k$ such that, for all $n>N_k$,

Let $\delta\geq2$ be fixed, and let $w\in\mathbb Q\cap[\delta/2,\delta-1]$. Density-realization conjecture. There exists a graph $F$ such that … This would extend the dense-range r…

Let $F$ be a graph, and let $w_F$ denote its weak saturation limit. Rationality conjecture. For any graph $F$, $w_F$ is rational. This asks whether all weak saturation limits are r…

For a maximal planar graph $G$ on $n$ vertices, let its plane-saturation ratio be the relevant ratio measuring the size of a largest plane-saturated subgraph relative to $G$. Plane…

Let $K_k^n$ be the complete $k$-partite graph with $n$ vertices in each part, let $C_{\geq\ell}$ be the family of cycles of length at least $\ell$, and let $\Omega^{(\ell,k,n)}$ be…

Let $K_4^n$ be the complete $4$-partite graph with $n$ vertices in each part, and let $C_4$ be the cycle of length four. Complete four-partite $C_4$-saturation conjecture. For ever…

Let $K_{n_1,n_2}$ be a complete bipartite graph, and let $C_{2\ell}$ denote the cycle of length $2\ell$. Even-cycle bipartite saturation conjecture. For $\ell\geq 4$ and…

Fix $k\geq 2$, let $K_k^n$ be the complete $k$-partite graph with $n$ vertices in each part, and let $F$ be a subgraph of $K_k^n$. Partite saturation limit conjecture. The limit ……

Let $G$ be an edge-ordered graph, and let $sat_e(n,G)$ denote its edge-ordered saturation function. Almost-linear saturation conjecture. For every edge-ordered graph $G$, … This is…

Let $G$ be an edge-ordered graph, and let $sat_e(n,G)$ denote its edge-ordered saturation function. Near-linear saturation conjecture. For every edge-ordered graph $G$, … The paper…

Disjoint-neighborhood saturation conjecture. Under these hypotheses,

Let $G$) be an edge-ordered graph and let $e_0$ be an isolated minimal edge of $G$. Write $F=e_0+G$. The isolated-edge saturation conjecture. … The authors present this as a candid…

Planar partial saturation ratio conjecture. Every such graph satisfies

Partial saturation ratio conjecture. Every such graph satisfies

Triangle-edge dichotomy conjecture. Let $0<p<1$ be a constant. If every edge of $F$ belongs to a triangle in $F$, then, with high probability,

Color-critical-edge stability conjecture. Every $F$-saturated graph $G$ on $n$ vertices with $t_r(n)-o(n^{\frac{r+1}{r}})$ edges contains a complete $r$-partite subgraph $G'$ on…

Nagy's conjecture. Every $F$-saturated graph $G$ on $n$ vertices with $t_r(n)-o(n^{\frac{r+1}{r}})$ edges contains a complete $r$-partite subgraph on $(1-o(1))n$ vertices.

Let $H_1$ and $H_2$ be graphs that are (strongly) sat-sharp, and let $H_1+H_2$ denote their disjoint union. Disjoint-union conjecture. If $H_1$ and $H_2$ are (strongly) sat-sharp g…

Let $K_k$ be the complete graph on $k$ vertices, let $\mathcal{R}(K_k)$ be the family of rainbow edge-colorings of $K_k$, and let $\operatorname{sat}_t(n,\mathcal{R}(K_k))$ denote…

Let $1\le s\le t$ be integers. A bipartite graph is $K_{s,t}$-saturated if it contains no copy of $K_{s,t}$, but adding any missing edge between its color classes creates a copy of…

Erdős–Tuza conjecture.