Girth-Chromatic (Q40962)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

AFP entry Girth_Chromatic
Language Label Description Also known as
default for all languages
No label defined
    English
    Girth-Chromatic
    AFP entry Girth_Chromatic

      Statements

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      Lars Noschinski
      0 references
      This works presents a formalization of the Girth-Chromatic number theorem in graph theory, stating that graphs with arbitrarily large girth and chromatic number exist. The proof uses the theory of Random Graphs to prove the existence with probabilistic arguments.
      0 references
      6 February 2012
      0 references
      A Probabilistic Proof of the Girth-Chromatic Number Theorem (English)
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references