Triangles in graphs #
A triangle in a simple graph is a
3-clique, namely a set of three vertices that are
This module defines and proves properties about triangles in simple graphs.
Main declarations #
SimpleGraph.FarFromTriangleFree: Predicate for a graph such that one must remove a lot of edges from it for it to become triangle-free. This is the crux of the Triangle Removal Lemma.
farFromTriangleFreeto other graphs, to state and prove the Graph Removal Lemma.
Alias of the forward direction of