论文标题
顶点图的极端函数
The Extremal Function for Apex Graphs
论文作者
论文摘要
麦卡蒂（McCarty）和托马斯（Thomas）猜想，带有$ n \ ge 7 $顶点和$ t $ triangles的无连锁嵌入式图最多具有$ 3n-9 +\ frac {t} {3} $ edges。托马斯（Thomas）和尤（Yoo）证明这对于顶点图是正确的。我们为Apex情况提供了更短，更简单的证明。
McCarty and Thomas conjectured that a linklessly embeddable graph with $n\ge 7 $ vertices and $t$ triangles has at most $3n-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.
