Circular Coloring and Mycielski Construction

Details Circular Coloring and Mycielski Construction Circular Coloring and Mycielski Construction

2009-04-08

arxiv.org/abs/0904.1319v1

Mathematics

Combinatorics

Scientific paper

In this paper, we investigate circular chromatic number of Mycielski construction of graphs. It was shown in \cite{MR2279672} that $t^{{\rm th}}$ Mycielskian of the Kneser graph $KG(m,n)$ has the same circular chromatic number and chromatic number provided that $m+t$ is an even integer. We prove that if $m$ is large enough, then $\chi(M^t(KG(m,n)))=\chi_c(M^t(KG(m,n)))$ where $M^t$ is $t^{{\rm th}}$ Mycielskian. Also, we consider the generalized Kneser graph $KG(m,n,s)$ and show that there exists a threshold $m(n,s,t)$ such that $\chi(M^t(KG(m,n,s)))=\chi_c(M^t(KG(m,n,s)))$ for $m\geq m(n,s,t)$.

Affiliated with

Also associated with

No associations

Rating

Circular Coloring and Mycielski Construction does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Circular Coloring and Mycielski Construction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Circular Coloring and Mycielski Construction will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-214504