{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T18:53:25Z","timestamp":1763664805604},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T00:00:00Z","timestamp":1648425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T00:00:00Z","timestamp":1648425600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"ELKH Alfr\u00e9d R\u00e9nyi Institute of Mathematics"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2022,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We give a slight improvement on the size of a monochromatic double star we can guarantee in every <jats:italic>r<\/jats:italic>-coloring of the edges of <jats:inline-formula><jats:alternatives><jats:tex-math>$$K_n$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>K<\/mml:mi>\n                    <mml:mi>n<\/mml:mi>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>.<\/jats:p>","DOI":"10.1007\/s00373-022-02481-3","type":"journal-article","created":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T05:19:53Z","timestamp":1648531193000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improved Monochromatic Double Stars in Edge Colorings"],"prefix":"10.1007","volume":"38","author":[{"given":"G\u00e1bor N.","family":"S\u00e1rk\u00f6zy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,28]]},"reference":[{"key":"2481_CR1","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1002\/jgt.3190130607","volume":"13","author":"P Erd\u0151s","year":"1989","unstructured":"Erd\u0151s, P., Faudree, R., Gy\u00e1rf\u00e1s, A., Schelp, R.H.: Domination in colored complete graphs. J. Graph Theory 13, 713\u2013718 (1989)","journal-title":"J. Graph Theory"},{"key":"2481_CR2","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF02579271","volume":"1","author":"Z F\u00fcredi","year":"1981","unstructured":"F\u00fcredi, Z.: Maximum degree and fractional matchings in uniform hypergraphs. Combinatorica 1, 155\u2013162 (1981)","journal-title":"Combinatorica"},{"key":"2481_CR3","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0012-365X(79)90132-8","volume":"28","author":"JW Grossman","year":"1979","unstructured":"Grossman, J.W., Harary, F., Klawe, M.: Generalized Ramsey theory for graphs. X. Double stars. Discrete Math. 28, 247\u2013254 (1979)","journal-title":"Discrete Math."},{"key":"2481_CR4","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/s00373-008-0811-y","volume":"24","author":"A Gy\u00e1rf\u00e1s","year":"2008","unstructured":"Gy\u00e1rf\u00e1s, A., S\u00e1rk\u00f6zy, G.N.: Size of monochromatic double stars in edge colorings. Graphs Combinatorics 24, 531\u2013536 (2008)","journal-title":"Graphs Combinatorics"},{"key":"2481_CR5","unstructured":"Gy\u00e1rf\u00e1s, A.: Partition coverings and blocking sets in hypergraphs (in Hungarian). Commun. Comput. Auto. Inst. Hungarian Acad. Sci. 71, 62 pp (1977)"},{"key":"2481_CR6","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1002\/(SICI)1098-2418(199805)12:3<297::AID-RSA5>3.0.CO;2-Q","volume":"12","author":"J Koml\u00f3s","year":"1998","unstructured":"Koml\u00f3s, J., S\u00e1rk\u00f6zy, G.N., Szemer\u00e9di, E.: An algorithmic version of the Blow-up Lemma. Random Struct. Algorithms 12, 297\u2013312 (1998)","journal-title":"Random Struct. Algorithms"},{"key":"2481_CR7","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1002\/jgt.21854","volume":"80","author":"S Letzter","year":"2015","unstructured":"Letzter, S.: Large monochromatic triple stars in edge colourings. J. Graph Theory 80, 323\u2013328 (2015)","journal-title":"J. Graph Theory"},{"key":"2481_CR8","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1002\/jgt.20365","volume":"61","author":"H Liu","year":"2009","unstructured":"Liu, H., Morris, R., Prince, N.: Highly connected monochromatic subgraphs of multicoloured graphs. J. Graph Theory 61, 22\u201344 (2009)","journal-title":"J. Graph Theory"},{"key":"2481_CR9","doi-asserted-by":"publisher","first-page":"R41","DOI":"10.37236\/1657","volume":"9","author":"D Mubayi","year":"2002","unstructured":"Mubayi, D.: Generalizing the Ramsey problem through diameter. Electr. J. Combinatorics 9, R41 (2002)","journal-title":"Electr. J. Combinatorics"},{"issue":"3","key":"2481_CR10","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1002\/jgt.20587","volume":"69","author":"M Ruszink\u00f3","year":"2012","unstructured":"Ruszink\u00f3, M.: Large components in $$r$$-edge-colorings of $$K_n$$ have diameter at most five. J. Graph Theory 69(3), 337\u2013340 (2012)","journal-title":"J. Graph Theory"},{"key":"2481_CR11","unstructured":"Szemer\u00e9di, E.: Regular partitions of graphs, Colloques Internationaux C.N.R.S. $$\\text{N}^{\\underline{o}}$$ 260 - Probl\u00e8mes Combinatoires et Th\u00e9orie des Graphes. Orsay, 399\u2013401 (1976)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02481-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-022-02481-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02481-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T22:45:03Z","timestamp":1654814703000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-022-02481-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,28]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["2481"],"URL":"https:\/\/doi.org\/10.1007\/s00373-022-02481-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,28]]},"assertion":[{"value":"26 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 March 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"78"}}