Universal bridge-free graphs

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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$.

Keywords

Logic

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/152929

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/9409206
 http://arxiv.org/abs/math/9409206

Collections

arXiv