3 problems

Dong and Wu's conjecture. Every tight (2,0)-stable graph is Hamiltonian.

Let $\mathcal{C}$ be a stable class of graphs of twin-width at most $2$. Stable twin-width 2 conjecture. Then $\mathcal{C}$ has bounded clique-width. This conjecture is the correct…

Stable hereditary-class adjacency sketch conjecture. The class ${\mathcal F}$ admits a constant-size adjacency sketch.