2 problems

0 votes0 replies0 views
Erdős–Faudree–Gyárfás–Schelp conjecture on cycle lengths in degree 3-critical graphs
A graph is degree 3-critical if it has $n$ vertices, $2n-2$ edges, and no proper induced subgraph with minimum degree at least $3$ . Erdős–Faudree–Gyárfás–Schelp conjecture. Every d…
Conjecturerefutedcycles degree-critical-graphs graph-theoryarXiv posted 2 days ago
0 votes0 replies0 views
Narins–Pokrovskiy–Szabó conjecture on cycle-length diversity in degree 3-critical graphs
A graph is degree 3-critical if it has $n$ vertices, $2n-2$ edges, and no proper induced subgraph with minimum degree at least $3$ . Narins–Pokrovskiy–Szabó conjecture. Every degree…
Conjecturerefutedcycles degree-critical-graphs graph-theoryarXiv posted 2 days ago

Erdős–Faudree–Gyárfás–Schelp conjecture on cycle lengths in degree 3-critical graphs