2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/152929We 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$.Logictext