combinatorics / Graph theory (automated conjecture)
The formalization proves the statement under the weaker hypothesis n >= 2; the pull request marking the conjecture solved is open, not merged
Temporal state
No reconciled state yet.
Append-only history
The formalization proves the statement under the weaker hypothesis n >= 2; the pull request marking the conjecture solved is open, not merged
Research memory
The formalization proves the statement under the weaker hypothesis n >= 2; the pull request marking the conjecture solved is open, not merged
The formalization proves the statement under the weaker hypothesis n >= 2; the pull request marking the conjecture solved is open, not merged
Evidence graph
parent of · event · claim reported