3 citations · 4 across the 9 of their papers we have counts for
1 paper · 1 filter
Elena Pavelescu
McCarty and Thomas conjectured that a linklessly embeddable graph with n≥7 vertices and t triangles has at most 3n−9+3t edges. Thomas and Yoo proved this to be…