# Commit 2024-03-29 15:08 e899dfee

View on Github →feat(Combinatorics/SimpleGraph): A graph has 3-clique iff it has a cycle of length 3 (#11434)
This is nice to have because when combined with `is3Clique_iff`

, we will be able to prove that a graph has a cycle by just proving that 3 vertices are pairwise adjacent.