There is no universal countable random-free graph
组合数学
2007-05-23 v1
摘要
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.
关键词
引用
@article{arxiv.math/0106102,
title = {There is no universal countable random-free graph},
author = {Masasi Higasikawa},
journal= {arXiv preprint arXiv:math/0106102},
year = {2007}
}
备注
3 pages