There is no universal countable random-free graph

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We consider embeddings between infinite graphs. In particular, We establish that there is no universal element in the class of countable graphs into which the random graph is not embeddable.
3 pages

Keywords

Combinatorics, 05C99

Citation

URI

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

Consulte el texto completo en el siguiente enlace:

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

Collections

arXiv