There is no universal countable random-free graph

Simple item page
dc.creatorHigasikawa, Masasi
dc.date2001-06-13
dc.date.accessioned2026-07-07T04:42:08Z
dc.date.available2026-07-07T04:42:08Z
dc.descriptionWe 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.
dc.description3 pages
dc.identifierhttps://arxiv.org/abs/math/0106102
dc.identifierhttp://arxiv.org/abs/math/0106102
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/61645
dc.subjectCombinatorics
dc.subject05C99
dc.titleThere is no universal countable random-free graph
dc.typetext

Files

Collections

arXiv