`GraphInvariant`

definition

show as: view math explainer →

module: IndisputableMonolith.Mathematics.GraphInvariantsFromConfigDim
domain: Mathematics
line: 18 · github
papers citing: none yet

open explainer

Read the cached plain-language explainer.

open lean source

IndisputableMonolith.Mathematics.GraphInvariantsFromConfigDim on GitHub at line 18.

browse module

All declarations in this module, on Recognition.

explainer page

A cached Ask Recognition explainer exists for this declaration.

open explainer

used by

formal source

  15
  16namespace IndisputableMonolith.Mathematics.GraphInvariantsFromConfigDim
  17
  18inductive GraphInvariant where
  19  | chromaticNumber
  20  | cliqueNumber
  21  | independenceNumber
  22  | genus
  23  | treewidth
  24  deriving DecidableEq, Repr, BEq, Fintype
  25
  26theorem graphInvariant_count : Fintype.card GraphInvariant = 5 := by decide
  27
  28structure GraphInvariantsCert where
  29  five_invariants : Fintype.card GraphInvariant = 5
  30
  31def graphInvariantsCert : GraphInvariantsCert where
  32  five_invariants := graphInvariant_count
  33
  34end IndisputableMonolith.Mathematics.GraphInvariantsFromConfigDim

papers checked against this theorem

No papers in the current corpus map onto this theorem yet.