Exact upper bounds for the minimum sizes of strong and weak separating path systems of cliques
Abstract
We prove an upper bound of n+9 for the strong separation number of the complete graph Kn, and an upper bound of n+1 for its weak separation number. This improves on the previous best known bound of (1+o(1))n for both cases.
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.