Splitting vertices of bipartite graphs preserves de Bruijn-Erdos property
Abstract
In this note, we prove that every graph obtained from a bipartite graph by iteratively splitting vertices into two adjacent twins has the de Bruijn-Erdos property.
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.