Almost-perfect packings and Tuza's conjecture in the random geometric graph

Patrick Bennett, Ryan Cushman, Andrzej Dudek +1

The triangle packing number $\hat{I}½(G)$ of a graph $G$ is the maximum size of a set of edge-disjoint triangles in $G$. Tuza conjectured that in any graph $G$ there exists a set of at m…