Universal bridge-free graphs

Abstract

We prove that there is no countable universal $B_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\ge 2$.