A Counterexample to an Eternal Domination Conjecture
A graph $G$ with 243 vertices is shown having $\gamma(G) = \gamma^{\infty}(G)<\theta(G)$, disproving the Gamma-Theta conjecture for eternal dominating sets.
2 papers indexed here
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
A graph $G$ with 243 vertices is shown having $\gamma(G) = \gamma^{\infty}(G)<\theta(G)$, disproving the Gamma-Theta conjecture for eternal dominating sets.
This work introduces FrontierMath Erd\H{o}s (FME), a benchmark of 68 Erd\H{o}s problems that are open as of August 2026, and evaluates every AI model on the same fixed problems, autonomously and under the same budget.
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.