file.pdf (756 kB)
Universal bridge free graphs
journal contribution
posted on 1994-01-01, 00:00 authored by Martin Goldstern, Menachem KojmanAbstract: "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."