Universal bridge free graphs Martin Goldstern Menachem Kojman 10.1184/R1/6480179.v1 https://kilthub.cmu.edu/articles/journal_contribution/Universal_bridge_free_graphs/6480179 Abstract: "We prove that there is no countable universal B[subscript n]-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 [> or =] 2." 1994-01-01 00:00:00 Bridges (Graph theory)