Math 2.0

Concept

γ–θ conjecture

Summary

  • γ–θ conjecture: Does there exist a graph GG such that the dominating number, eternal domination number, and clique covering number satisfy γ(G)=γ∞(G)<θ(G)\gamma(G)=\gamma_\infty(G)<\theta(G)?

Further reading

  1. Wikipedia, page 183091, revision 1376385932, List of unsolved problems in mathematics, section Unsolved problems > Graph theory > Games on graphs. adopted
About this page
TagEWXK06TF9Y
URIm2://EWXK06TF9Y
Kindconcept
WritingW1 stated
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge defines in: at least one definition (0 of 1)
  • edge instance_of in: at least two examples (0 of 2)
  • edge not_instance_of in: at least one non-example (0 of 1)
  • edge specializes both: the more general notions and the special cases (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.