McCarty and Thomas conjectured that a linklessly embeddable graph with $n\ge 7 verticesandverticesandttriangleshasatmosttriangleshasatmost3n-9 +\frac{t}{3}$ edges. Thomas and Yoo proved this to be true for apex graphs. We give a shorter and simpler proof for the apex case.
生成讲解博客的中文版本
生成AI智能校验的中文版本