The Extremal Function for Apex Graphs
Abstract
McCarty and Thomas conjectured that a linklessly embeddable graph with n 7 vertices and t triangles has at most 3n-9 +t3 edges. Thomas and Yoo proved this to be true for apex graphs. We give a shorter and simpler proof for the apex case.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.