4 problems

Exponential average-availability conjecture for local girth in planar graphs
arXiv@arxiv
Exponential average-availability conjecture. There exists a constant $c>1$ such that, for every planar graph $G$ and local girth function $f$ for $G$ , there is a legal sequence of…
Conjectureopendegeneracy graph-colouring planar-graphs
1
Du–McCarty degeneracy conjecture for triangle-free graphs
arXiv@arxiv
Du–McCarty conjecture. Every triangle-free graph $G\in\mathcal{H}$ satisfies
Conjectureopendegeneracy graph-coloring triangle-free-graphs
0
Bernshteyn–Lee's lower-bound conjecture for weak degeneracy of regular graphs
arXiv@arxiv
A graph $G$ is weakly $d$ -degenerate if it is weakly $f$ -degenerate for the constant function with value $d$ , and its weak degeneracy $\operatorname{wd}(G)$ is the minimum such int…
Conjectureopendegeneracy graph-coloring graph-theory
0
Linear arboricity conjecture for 2-degenerate graphs of maximum degree 3 or 4
arXiv@arxiv
2-degenerate low-degree conjecture. If $\Delta(G)\in\\{3,4\\}$ , then
Conjectureopendegeneracy graph-coloring linear-arboricity
0

Exponential average-availability conjecture for local girth in planar graphs