Universal bridge-free graphs
Logic
2008-02-03 v1
Abstract
We prove that there is no countable universal -free graph for all and that there is no countable universal graph in the class of graphs omitting all cycles of length at most for .
Cite
@article{arxiv.math/9409206,
title = {Universal bridge-free graphs},
author = {Martin Goldstern and Menachem Kojman},
journal= {arXiv preprint arXiv:math/9409206},
year = {2008}
}