pith. machine review for the scientific record. sign in
theorem

graphInvariant_count

proved
show as:
view math explainer →
module
IndisputableMonolith.Mathematics.GraphInvariantsFromConfigDim
domain
Mathematics
line
26 · github
papers citing
none yet

open explainer

Generate a durable explainer page for this declaration.

open lean source

IndisputableMonolith.Mathematics.GraphInvariantsFromConfigDim on GitHub at line 26.

browse module

All declarations in this module, on Recognition.

explainer page

Tracked in the explainer inventory; generation is lazy so crawlers do not trigger LLM jobs.

open explainer

depends on

used by

formal source

  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.