Triangulating Almost-Complete Graphs

Kim Nguyen Pham, Landon Settle, Kayla Wright +1

A triangle decomposition of a graph $G$ is a partition of the edges of $G$ into triangles. Two necessary conditions for $G$ to admit such a decomposition are that $|E(G)|$ is a mul…