{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T15:19:41Z","timestamp":1777562381295,"version":"3.51.4"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,5,16]],"date-time":"2015-05-16T00:00:00Z","timestamp":1431734400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11171310"],"award-info":[{"award-number":["11171310"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s10878-015-9897-3","type":"journal-article","created":{"date-parts":[[2015,5,15]],"date-time":"2015-05-15T10:32:37Z","timestamp":1431685957000},"page":"765-774","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A combinatorial proof for the circular chromatic number of Kneser graphs"],"prefix":"10.1007","volume":"32","author":[{"given":"Daphne Der-Fen","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuding","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,5,16]]},"reference":[{"key":"9897_CR1","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1090\/S0002-9947-1986-0857448-8","volume":"298","author":"N Alon","year":"1986","unstructured":"Alon N, Frankl P, Lov\u00e1sz LL (1986) The chromatic number of Kneser hypergraphs. Trans Am Math Soc 298:359\u2013370","journal-title":"Trans Am Math Soc"},{"key":"9897_CR2","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0097-3165(78)90023-7","volume":"25","author":"I B\u00e1r\u00e1ny","year":"1978","unstructured":"B\u00e1r\u00e1ny I (1978) A short of Kneser\u2019s conjecture. J Combin Theory A 25:325\u2013326","journal-title":"J Combin Theory A"},{"key":"9897_CR3","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/j.jcta.2012.07.009","volume":"120","author":"GJ Chang","year":"2013","unstructured":"Chang GJ, Liu DD-F, Zhu X (2013) A short proof for Chen\u2019s Alternative Kneser Coloring Lemma. J Combin Theory A 120:159\u2013163","journal-title":"J Combin Theory A"},{"issue":"3","key":"9897_CR4","doi-asserted-by":"crossref","first-page":"1062","DOI":"10.1016\/j.jcta.2010.08.008","volume":"118","author":"P-A Chen","year":"2011","unstructured":"Chen P-A (2011) A new coloring theorem of Kneser graphs. J Combin Theory A 118(3):1062\u20131071","journal-title":"J Combin Theory A"},{"issue":"56","key":"9897_CR5","doi-asserted-by":"crossref","first-page":"431","DOI":"10.2307\/1969651","volume":"2","author":"K Fan","year":"1952","unstructured":"Fan K (1952) A generalization of Tucker\u2019s combinatorial lemma with topological applications. Ann Math 2(56):431\u2013437","journal-title":"Ann Math"},{"key":"9897_CR6","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0097-3165(81)90027-3","volume":"30","author":"RM Freund","year":"1981","unstructured":"Freund RM, Todd MJ (1981) A constructive proof of Tucker\u2019s combinatorial lemma. J Combin Theory A 30:321\u2013325","journal-title":"J Combin Theory A"},{"key":"9897_CR7","doi-asserted-by":"crossref","first-page":"918","DOI":"10.2307\/3072460","volume":"109","author":"J Greene","year":"2002","unstructured":"Greene J (2002) A new short proof of Kneser\u2019s conjecture. Am Math Monthly 109:918\u2013920","journal-title":"Am Math Monthly"},{"issue":"2","key":"9897_CR8","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0095-8956(03)00032-7","volume":"88","author":"H Hajiabolhassan","year":"2003","unstructured":"Hajiabolhassan H, Zhu X (2003) Circular chromatic number of Kneser graphs. J Combin Theory B 88(2):299\u2013303","journal-title":"J Combin Theory B"},{"issue":"1","key":"9897_CR9","doi-asserted-by":"crossref","first-page":"R17","DOI":"10.37236\/289","volume":"17","author":"H Hajiabolhassan","year":"2010","unstructured":"Hajiabolhassan H, Taherkhani A (2010) Graph powers and graph homomorphisms. Electron J Combin 17(1):R17","journal-title":"Electron J Combin"},{"issue":"3","key":"9897_CR10","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1002\/(SICI)1097-0118(199711)26:3<137::AID-JGT4>3.0.CO;2-S","volume":"26","author":"A Johnson","year":"1997","unstructured":"Johnson A, Holroyd FC, Stahl S (1997) Multichromatic numbers, star chromatic numbers and Kneser graphs. J Graph Theory 26(3):137\u2013145","journal-title":"J Graph Theory"},{"key":"9897_CR11","first-page":"27","volume":"58","author":"M Kneser","year":"1955","unstructured":"Kneser M (1955) Aufgabe 300. Jber Deutsch Math Verein 58:27","journal-title":"Jber Deutsch Math Verein"},{"key":"9897_CR12","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1090\/S0002-9947-1992-1081939-3","volume":"333","author":"I Kriz","year":"1992","unstructured":"Kriz I (1992) Equivalent cohomology and lower bounds for chromatic numbers. Trans Am Math Soc 333:567\u2013577","journal-title":"Trans Am Math Soc"},{"key":"9897_CR13","doi-asserted-by":"crossref","first-page":"1951","DOI":"10.1090\/S0002-9947-99-02494-0","volume":"352","author":"I Kriz","year":"2000","unstructured":"Kriz I (2000) A corretion to \u201cEquivalent cohomology and lower bounds for chromatic numbers. Trans Am Math Soc 352:1951\u20131952","journal-title":"Trans Am Math Soc"},{"key":"9897_CR14","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1002\/jgt.10052","volume":"41","author":"K-W Lih","year":"2002","unstructured":"Lih K-W, Liu DD-F (2002) Circular chromatic numbers of some reduced Kneser graphs. J Graph Theory 41:62\u201368","journal-title":"J Graph Theory"},{"issue":"3","key":"9897_CR15","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0097-3165(78)90022-5","volume":"25","author":"L Lov\u00e1sz","year":"1978","unstructured":"Lov\u00e1sz L (1978) Kneser\u2019s conjecture, chromatic number, and homotopy. J Combin Theory A 25(3):319\u2013324","journal-title":"J Combin Theory A"},{"key":"9897_CR16","volume-title":"Using the Borsuk\u2013Ulam theorem: lectures on topological methods in combinatorics and geometry","author":"J Matou\u0161ek","year":"2003","unstructured":"Matou\u0161ek J (2003) Using the Borsuk\u2013Ulam theorem: lectures on topological methods in combinatorics and geometry. Springer, Berlin"},{"key":"9897_CR17","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s00493-004-0011-1","volume":"24","author":"J Matou\u0161ek","year":"2004","unstructured":"Matou\u0161ek J (2004) A combinatorial proof of Kneser\u2019s conjecture. Combinatorica 24:163\u2013170","journal-title":"Combinatorica"},{"issue":"4","key":"9897_CR18","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1002\/jgt.20079","volume":"49","author":"F Meunier","year":"2005","unstructured":"Meunier F (2005) A topological lower bound for the circular chromatic number of Schrijver graphs. J Graph Theory 49(4):257\u2013261","journal-title":"J Graph Theory"},{"key":"9897_CR19","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/j.jcta.2004.12.005","volume":"111","author":"T Prescott","year":"2005","unstructured":"Prescott T, Su F (2005) A constructive proof of Ky Fan\u2019s generalization of Tucker\u2019s lemma. J Combin Theory A 111:257\u2013265","journal-title":"J Combin Theory A"},{"key":"9897_CR20","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/0095-8956(90)90029-Y","volume":"49","author":"KS Sarkaria","year":"1990","unstructured":"Sarkaria KS (1990) A generalized Kneser conjecture. J Combin Theory B 49:236\u2013240","journal-title":"J Combin Theory B"},{"key":"9897_CR21","first-page":"454","volume":"26","author":"A Schrijver","year":"1978","unstructured":"Schrijver A (1978) Vertex-critical subgraphs of Kneser graphs. Nieuw Arch Wiskd III 26:454\u2013461","journal-title":"Nieuw Arch Wiskd III"},{"issue":"5","key":"9897_CR22","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1007\/s00493-006-0034-x","volume":"26","author":"G Simonyi","year":"2006","unstructured":"Simonyi G, Tardos G (2006) Local chromatic number, Ky Fan\u2019s theorem and circular colorings. Combinatorica 26(5):587\u2013626","journal-title":"Combinatorica"},{"key":"9897_CR23","unstructured":"Tucker AW (1946) Some topological properties of disk and sphere. In: Proceedings of the first Canadian Mathematical Congress, Montreal. University of Toronto Press, Toronto, pp 285\u2013309"},{"issue":"1\u20133","key":"9897_CR24","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S0012-365X(00)00217-X","volume":"229","author":"X Zhu","year":"2001","unstructured":"Zhu X (2001) Circular chromatic number: a survey. Discrete Math 229(1\u20133):371\u2013410","journal-title":"Discrete Math"},{"key":"9897_CR25","doi-asserted-by":"crossref","unstructured":"Zhu X (2006) Recent developments in circular colouring of graphs. Topics in discrete mathematics. Algorithms and combinatorics, vol 26. Springer, Berlin, pp 497\u2013550","DOI":"10.1007\/3-540-33700-8_25"},{"key":"9897_CR26","unstructured":"Zhu X (2012) Circular coloring and flow. Lecture note"},{"key":"9897_CR27","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1007\/s002220100188","volume":"147","author":"G Ziegler","year":"2002","unstructured":"Ziegler G (2002) Generalized Kneser coloring theorems with combinatorial proofs. Invent Math 147:671\u2013691","journal-title":"Invent Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9897-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9897-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9897-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,2]],"date-time":"2020-09-02T06:11:11Z","timestamp":1599027071000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9897-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,16]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["9897"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9897-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,16]]}}}