A polynomial bound on the number of minimal separators and potential maximal cliques in P6-free graphs of bounded clique number
Abstract
In this note we show a polynomial bound on the number of minimal separators and potential maximal cliques in P6-free graphs of bounded clique number.
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.