2000 character limit reached
Splitting vertices of bipartite graphs preserves de Bruijn-Erdős property (2511.17156v1)
Published 21 Nov 2025 in cs.DM and math.CO
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-Erdős property.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.