Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9515956 | Journal of Combinatorial Theory, Series B | 2005 | 7 Pages |
Abstract
We 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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Hamed Hatami,