Universal bridge-free graphs

Martin Goldstern, Menachem Kojman

Research output: Working paper/PreprintPreprint

23 Downloads (Pure)


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.
Original languageEnglish GB
PublisherarXiv:math/9409206 [math.LO]
StatePublished - 1994


  • Mathematics - Logic


Dive into the research topics of 'Universal bridge-free graphs'. Together they form a unique fingerprint.

Cite this