{"paper":{"title":"On the circular chromatic number of a subgraph of the Kneser graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bart Litjens, Bart Sevenster, Llu\\'is Vena, Sven Polak","submitted_at":"2018-03-12T16:07:44Z","abstract_excerpt":"Let $n,k,r$ be positive integers with $n \\geq rk$ and $r \\geq 2$. Consider a circle $C$ with~$n$ points~$1,\\ldots,n$ in clockwise order. The $r$-stable \\emph{interlacing graph} $\\text{IG}_{n,k}^{(r)}$ is the graph with vertices corresponding to $k$-subsets $S$ of $\\{1,...,n\\}$ such that any two distinct points in~$S$ have distance at least~$r$ around the circle, and edges between~$k$-subsets $P$ and $Q$ if they \\emph{interlace}: after removing the points in~$P$ from $C$, the points in~$Q$ are in different connected components. In this paper we prove that the circular chromatic number of $\\text"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04342","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}