Commit 2024-04-03 07:47 af01418e

View on Github →

feat(Combinatorics/SimpleGraph): Girth is at least 3 (#11709) General lowerbound for girth, for example could be used to prove that girth equals 3 given 3 as an upperbound.

Estimated changes