Random cubic graphs are not homomorphic to the cycle of size 7

Simple item page
dc.creatorHatami, Hamed
dc.date2006-12-31
dc.date.accessioned2026-07-07T07:37:56Z
dc.date.available2026-07-07T07:37:56Z
dc.descriptionWe prove that a random cubic graph almost surely is not homomorphic to a cycle of size 7. This implies that there exist cubic graphs of arbitrarily high girth with no homomorphisms to the cycle of size 7.
dc.identifierhttps://arxiv.org/abs/math/0701013
dc.identifierhttp://arxiv.org/abs/math/0701013
dc.identifierJ. Combin. Theory Ser. B 93(2) (2005) pp. 319-325
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/120949
dc.subjectCombinatorics
dc.subject05C80
dc.titleRandom cubic graphs are not homomorphic to the cycle of size 7
dc.typetext

Files

Collections

arXiv