Closed YaelDillies closed 11 months ago
Define predicates for a graph to have edge-disjoint triangles and to be locally linear (edge-disjoint triangles and each edge belongs to a triangle).
This PR/issue depends on:
Ported to LeanCamCombi.
Define predicates for a graph to have edge-disjoint triangles and to be locally linear (edge-disjoint triangles and each edge belongs to a triangle).