/-
Copyright 2026 The Formal Conjectures Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
-/modulepublicimportFormalConjecturesUtil
T is a triangle packing of G: a set of pairwise edge-disjoint triangles of G.
Two distinct triangles are edge-disjoint exactly when they share at most one vertex.
Tuza's conjecture (1981): every finite graph $G$ satisfies $\tau(G) \le 2\nu(G)$,
where $\tau(G)$ is its triangle covering number and $\nu(G)$ is its triangle packing number.
The bound would be sharp, for example for $K_4$ and $K_5$.