{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T13:29:45Z","timestamp":1782566985040,"version":"3.54.5"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1991,9,1]],"date-time":"1991-09-01T00:00:00Z","timestamp":683683200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1991,9]]},"DOI":"10.1007\/bf01205076","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T15:15:52Z","timestamp":1109258152000},"page":"245-251","source":"Crossref","is-referenced-by-count":1,"title":["A note on induced cycles in Kneser graphs"],"prefix":"10.1007","volume":"11","author":[{"given":"Y.","family":"Kohayakawa","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"P. Alles, S. Poljak: Long induced paths and cycles in Kneser graphs, to appear."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/0097-3165(85)90048-2","volume":"40","author":"N. Alon","year":"1985","unstructured":"N. Alon: An extremal problem for a sets with applications to graph theory,J. Comb. Theory (A) 40 (1985), 82?89.","journal-title":"J. Comb. Theory (A)"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF02579381","volume":"6","author":"N. Alon","year":"1986","unstructured":"N. Alon: Covering graphs by the minimum number of equivalence relations,Combinatorica 6 (1986), 201?206.","journal-title":"Combinatorica"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0097-3165(78)90023-7","volume":"25","author":"I. B\ufffdr\ufffdny","year":"1978","unstructured":"I. B\ufffdr\ufffdny: A short proof of Knesser's conjecture,J. Combinatorial Theory (A) 25 (1978), 325?326.","journal-title":"J. Combinatorial Theory (A)"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1017\/S0305004100052063","volume":"79","author":"B. Bollob\ufffds","year":"1976","unstructured":"B. Bollob\ufffds: On comnplete subgraphs of different orders,Math. Pro. Cambridge Soc. 79 (1976), 19?24.","journal-title":"Math. Pro. Cambridge Soc."},{"key":"CR6","volume-title":"Extremal Graph Theory","author":"B. Bollob\ufffds","year":"1978","unstructured":"B. Bollob\ufffds:Extremal Graph Theory, Academic Press, London 1978, xx+ 488pp."},{"key":"CR7","first-page":"257","volume":"27","author":"D. Caen de","year":"1985","unstructured":"D. de Caen, D. A. Greagory, N. J. Pullman: Clique coverings of complements of paths and cycles,Annals of Discrete Mathematics 27 (1985), 257?268.","journal-title":"Annals of Discrete Mathematics"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"106","DOI":"10.4153\/CJM-1966-014-3","volume":"18","author":"P. Erd?s","year":"1966","unstructured":"P. Erd?s, W. A. Goodman, L. P\ufffdsa: The representation of a graph by set intersections,Can. J. Math. 18 (1966), 106?112.","journal-title":"Can. J. Math."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0195-6698(82)80025-5","volume":"3","author":"P. Frankl","year":"1982","unstructured":"P. Frankl: An extremal problem for two families of sets,Europ. J. Comb. 3 (1982), 125?127.","journal-title":"Europ. J. Comb."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0095-8956(86)90084-5","volume":"40","author":"P. Frankl","year":"1986","unstructured":"P. Frankl, andZ. F\ufffdredi: Extremal problems concerning Kneser graphs,J. Combinatorial Theory (B) 40 (1986), 270?284.","journal-title":"J. Combinatorial Theory (B)"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF01864160","volume":"4","author":"Z. F\ufffdredi","year":"1988","unstructured":"Z. F\ufffdredi: Matchings and covers in hypergraphs,Graphs and Combinatorics 4 (1988), 115?206.","journal-title":"Graphs and Combinatorics"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0012-365X(82)90085-1","volume":"41","author":"D. A. Gregory","year":"1982","unstructured":"D. A. Gregory, N. J. Pullman: On a clique covering problem of Orlin,Discrete Math. 41 (1982), 97?99.","journal-title":"Discrete Math."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF02761162","volume":"48","author":"G. Kalai","year":"1984","unstructured":"G. Kalai: Intersection patterns of convex sets,Israel J. Math. 48 (1984), 161?174.","journal-title":"Israel J. Math."},{"key":"CR14","first-page":"453","volume":"58","author":"M. Kneser","year":"1955","unstructured":"M. Kneser: Aufgabe 360,Jahresbericht Deutschen Math. Ver. 58 (1955), 453.","journal-title":"Jahresbericht Deutschen Math. Ver."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0097-3165(78)90022-5","volume":"25","author":"L. Lov\ufffdsz","year":"1978","unstructured":"L. Lov\ufffdsz: Kneser's conjecture, chromatic number and homotopy,J. Combinatorial Theory (A) 25 (1978), 319?324.","journal-title":"J. Combinatorial Theory (A)"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF01788540","volume":"3","author":"S. Poljak","year":"1987","unstructured":"S. Poljak, andZs. Tuza: Maximum bipartite subgraphs of Kneser graphs,Graphs and Combinatorics 3 (1987), 191?199.","journal-title":"Graphs and Combinatorics"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF01788540","volume":"3","author":"S. Poljak","year":"1987","unstructured":"S. Poljak, andZs. Tuza: Maximum bipartite subgraphs of Knesser graphs,Graphs and Combinatorics 3 (1987), 191?199.","journal-title":"Graphs and Combinatorics"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01205076.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01205076\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01205076","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T17:06:06Z","timestamp":1556730366000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01205076"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,9]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,9]]}},"alternative-id":["BF01205076"],"URL":"https:\/\/doi.org\/10.1007\/bf01205076","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,9]]}}}