Abstract
We consider the question of the existence of homomorphisms between $G_{n,p}$ and odd cycles when $p=c/n$, $1<c\leq 4$. We show that for any positive integer $\ell$, there exists $\epsilon=\epsilon(\ell)$ such that if $c=1+\epsilon$ then w.h.p. $G_{n,p}$ has a homomorphism from $G_{n,p}$ to $C_{2\ell+1}$ so long as its odd-girth is at least $2\ell+1$. On the other hand, we show that if $c=4$ then w.h.p. there is no homomorphism from $G_{n,p}$ to $C_5$. Note that in our range of interest, $\chi(G_{n,p})=3$ w.h.p., implying that there is a homomorphism from $G_{n,p}$ to $C_3$. These results imply the existence of random graphs with circular chromatic numbers $\chi_c$ satisfying $2<\chi_c(G)<2+\delta$ for arbitrarily small $\delta$, and also that $2.5\leq \chi_c(G_{n,\frac 4 n})<3$ w.h.p.
Highlights
The determination of the chromatic number of Gn,p, where p =c n for constant c, is a central topic in the theory of random graphs
We show that if c = 4 w.h.p. there is no homomorphism from Gn,p to C5
These results imply the existence of random graphs with circular chromatic numbers χc satisfying 2 < χc(G) < 2 + δ for arbitrarily small δ, and that 2.5 χc(Gn, 4 n w.h.p
Summary
C n for constant c, is a central topic in the theory of random graphs. For 0 < c < 1, such graphs contain, in expectation, a bounded number of cycles, and are almost-surely 3-colorable. The chromatic number of such a graph may be 2 or 3 with positive probability, according as to whether or not any odd cycles appear. Note that a fixed graph having a homomorphism to all odd-cycles is bipartite. Our results can be reformulated in terms of the circular chromatic number of a random graph. (See [12].) Since C2 +1, is the odd cycle C2 +1 our results can be restated as follows: Theorem 4. Inequalities for the circular chromatic number hold with high probability. As the probability that small odd-girth can be computed precisely, Theorem gives an exact probability in (0, 1). The second asserts that the circular chromatic numbers of random graphs should be dense.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.