{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T18:19:14Z","timestamp":1763662754645},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2008,11,1]],"date-time":"2008-11-01T00:00:00Z","timestamp":1225497600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2008,11]]},"DOI":"10.1007\/s00373-008-0811-y","type":"journal-article","created":{"date-parts":[[2008,12,1]],"date-time":"2008-12-01T09:27:42Z","timestamp":1228123662000},"page":"531-536","source":"Crossref","is-referenced-by-count":7,"title":["Size of Monochromatic Double Stars in Edge Colorings"],"prefix":"10.1007","volume":"24","author":[{"given":"Andr\u00e1s","family":"Gy\u00e1rf\u00e1s","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e1bor N.","family":"S\u00e1rk\u00f6zy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,12,2]]},"reference":[{"key":"811_CR1","unstructured":"Andr\u00e1sfai, B.: Remarks on a paper of Gerencs\u00e9r and Gy\u00e1rf\u00e1s, Ann. Univ. Sci. E\u00f6tv\u00f6s, Budapest 13, 103\u2013107 (1970)"},{"key":"811_CR2","unstructured":"Burr, S.A.: Either a graph or its complement has a spanning broom (manuscript)"},{"key":"811_CR3","unstructured":"Bialostocki, A., Dierker, P., Voxman, W.: Either a graph or its complement is connected: a continuing saga, manuscript (2001)"},{"key":"811_CR4","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B., Gy\u00e1rf\u00e1s, A.: Highly connected monochromatic subgraphs, Discrete Math. 308, 1722\u20131725 (2008)","DOI":"10.1016\/j.disc.2006.01.030"},{"key":"811_CR5","unstructured":"Erd\u0151s, P., Faudree, R., Gy\u00e1rf\u00e1s, A., Schelp, R.H.: Domination in colored complete graphs, Journal of Graph Theory 13, 713\u2013718 (1989)"},{"key":"811_CR6","unstructured":"Erd\u0151s, P., Fowler, T.: Finding large p-colored diameter two subgraphs, Graphs and Combinatorics 15, 21\u201327 (1999)"},{"key":"811_CR7","unstructured":"F\u00fcredi, Z.: Maximum degree and fractional matchings in uniform hypergraphs, Combinatorica 1, 155\u2013162 (1981)"},{"key":"811_CR8","doi-asserted-by":"crossref","unstructured":"Grossman, J.W., Harary, F., Klawe, M.: Generalized Ramsey theory for graphs. X. Double stars, Discrete Math. 28, 247\u2013254 (1979)","DOI":"10.1016\/0012-365X(79)90132-8"},{"key":"811_CR9","unstructured":"Gerencs\u00e9r, L., Gy\u00e1rf\u00e1s, A.: On Ramsey type problems, Ann. Univ. Sci. E\u00f6tv\u00f6s, Budapest 10, 167\u2013170 (1967)"},{"key":"811_CR10","doi-asserted-by":"crossref","unstructured":"Gy\u00e1rf\u00e1s, A., Lehel, J., Schelp, R.H., Tuza, Zs.: Ramsey numbers for local colorings, Graphs and Combinatorics 3, 267\u2013277 (1987)","DOI":"10.1007\/BF01788549"},{"key":"811_CR11","unstructured":"Gy\u00e1rf\u00e1s, A., Simonyi, G.: Edge colorings of complete graphs without tricolored triangles, Journal of Graph Theory 46, 211\u2013216 (2004)"},{"key":"811_CR12","unstructured":"Gy\u00e1rf\u00e1s, A., S\u00e1rk\u00f6zy, G.N.: Size of monochromatic components in local edge colorings, Discrete Math. 308, 2620\u20132622 (2008)"},{"key":"811_CR13","unstructured":"Gy\u00e1rf\u00e1s, A.: Partition coverings and blocking sets in hypergraphs (in Hungarian) Communications of the Computer and Automation Institute of the Hungarian Academy of Sciences 71, 62\u00a0pp (1977)"},{"key":"811_CR14","unstructured":"Liu, H., Morris, R., Prince, N.: Highly connected monochromatic subgraphs of multicoloured graphs, submitted"},{"key":"811_CR15","doi-asserted-by":"crossref","unstructured":"Mubayi, D.: Generalizing the Ramsey problem through diameter, Electronic Journal of Combinatorics 9, R41 (2002)","DOI":"10.37236\/1658"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0811-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-008-0811-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0811-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,12]],"date-time":"2020-05-12T07:08:24Z","timestamp":1589267304000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-008-0811-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11]]},"references-count":15,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2008,11]]}},"alternative-id":["811"],"URL":"https:\/\/doi.org\/10.1007\/s00373-008-0811-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,11]]}}}