Algorithm Search⌘K

Problemcore

Counting connected labeled graphs

Problem of counting connected labeled graphs on n vertices by subtracting disconnected graphs, using a recurrence on the component containing a fixed vertex.

Problem of counting connected labeled graphs on n vertices by subtracting disconnected graphs, using a recurrence on the component containing a fixed vertex.

About this page

The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.

LadderLevelWhat the next level needs
Human proofH0 no proof
  • add a proof in proofs/ (06.5)
LeanL0 no Lean part
  • name a Lean module in the lean field (07)
VisualV0 none
  • add viz/scene.ts or a figure (10)
WritingW0 stub
  • Definition
  • one source with a locator

Tag A93T41 Edit this page History Report an error