A note on stability for maximal F-free graphs

Abstract

Popielarz, Sahasrabudhe and Snyder in 2018 proved that maximal Kr+1-free graphs with (1-1r)n22-o(nr+1r) edges contain a complete r-partite subgraph on n-o(n) vertices. This was very recently extended to odd cycles in place of K3 by Wang, Wang, Yang and Yuan. We further extend it to some other 3-chromatic graphs, and obtain some other stability results along the way.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…