Circular Coloring and Mycielski Construction
| dc.creator | Alishahi, Meysam | |
| dc.creator | Hajiabolhassan, Hossein | |
| dc.date | 2009-04-08 | |
| dc.date.accessioned | 2026-07-07T13:01:43Z | |
| dc.date.available | 2026-07-07T13:01:43Z | |
| dc.description | 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 $χ(M^t(KG(m,n)))=χ_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 $χ(M^t(KG(m,n,s)))=χ_c(M^t(KG(m,n,s)))$ for $m\geq m(n,s,t)$. | |
| dc.identifier | https://arxiv.org/abs/0904.1319 | |
| dc.identifier | http://arxiv.org/abs/0904.1319 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/226239 | |
| dc.subject | Combinatorics | |
| dc.title | Circular Coloring and Mycielski Construction | |
| dc.type | text |