1 problem

0 votes0 replies2 views
Mahadev et al.'s substitution conjecture for strongly equistable graphs
A graph is strongly equistable if, for every nonempty subset $T$ that is not a maximal stable set and every $\gamma\leq 1$ , it admits positive vertex weights giving every maximal s…
Conjectureopenequistable-graphs graph-substitution graph-theoryarXiv posted 2 days ago

Mahadev et al.'s substitution conjecture for strongly equistable graphs