Universal bridge free graphs

1994-01-01T00:00:00Z (GMT) by Martin Goldstern Menachem Kojman
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."