{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,10]],"date-time":"2026-10-10T01:20:29Z","timestamp":1791595229048,"version":"4.3.4"},"reference-count":9,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>Balogh, Csaba, Jing, and Pluh\u00e1r [ Electron. J. Combin., 27 (2020)] recently determined the minimum degree threshold that ensures a 2-colored graph $G$ contains a Hamilton cycle of significant color bias (i.e., a Hamilton cycle that contains significantly more than half of its edges in one color). In this short note we extend this result, determining the corresponding threshold for $r$-colorings.<\/jats:p>","DOI":"10.1137\/20m1378983","type":"journal-article","created":{"date-parts":[[2021,5,11]],"date-time":"2021-05-11T10:34:09Z","timestamp":1620729249000},"page":"970-975","source":"Crossref","is-referenced-by-count":13,"title":["A Note on Color-Bias Hamilton Cycles in Dense Graphs"],"prefix":"10.1137","volume":"35","author":[{"given":"Andrea","family":"Freschi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joseph","family":"Hyde","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joanna","family":"Lada","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrew","family":"Treglown","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2021,5,11]]},"reference":[{"key":"atypb1","first-page":"27","author":"Balogh J.","year":"2020","journal-title":"Electron. J. Combin."},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548320000516"},{"key":"atypb3","doi-asserted-by":"crossref","unstructured":"D. Brada\u010d,\n                      Powers of Hamilton Cycles of High Discrepancy Are Unavoidable\n                      ,https:\/\/arxiv.org\/abs\/2102.10912, 2021.","DOI":"10.1007\/978-3-030-83823-2_72"},{"key":"atypb4","first-page":"29","volume":"14","author":"Erd\u00f6s P.","year":"1963","journal-title":"Mat. Lapok."},{"key":"atypb5","first-page":"47","volume":"30","author":"Erd\u00f6s P.","year":"1995","journal-title":"Stud. Sci. Math."},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230010407"},{"key":"atypb7","doi-asserted-by":"crossref","unstructured":"L. Gishboliner, M. Krivelevich, and P. Michaeli,\n                      Colour-Biased Hamilton Cycles in Random Graphs\n                      ,arXiv:2007.12111, 2020.","DOI":"10.1002\/rsa.21043"},{"key":"atypb8","unstructured":"L. Gishboliner, M. Krivelevich, and P. Michaeli,\n                      Discrepancies of Spanning Trees and Hamilton Cycles\n                      ,arXiv:2012.05155, 2020."},{"key":"atypb9","first-page":"355","volume":"8","author":"P\u00f3sa L.","year":"1963","journal-title":"Magyar. Tud. Akad. Mat. Kutat Int. K\u00f6zl."}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/20M1378983","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:44:13Z","timestamp":1787319853000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/20M1378983"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1137\/20M1378983"],"URL":"https:\/\/doi.org\/10.1137\/20m1378983","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1]]}}}