Separating edges by linearly many subdivisions
Abstract
We prove that for any two graphs G and H, the edges of G can be strongly separated by a collection of linearly many subdivisions of H and single edges. This confirms a conjecture of Botler and Naia.
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.