Universal bridge-free graphs
Abstract
We prove that there is no countable universal Bn-free graph for all n and that there is no countable universal graph in the class of graphs omitting all cycles of length at most 2k for k 2.
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.