{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,30]],"date-time":"2023-09-30T09:42:15Z","timestamp":1696066935913},"reference-count":11,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2003,1,30]],"date-time":"2003-01-30T00:00:00Z","timestamp":1043884800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[2003,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Let <jats:italic>f<\/jats:italic>(<jats:italic>n<\/jats:italic>) be the minimum number of colors required to color the edges of <jats:italic>K<jats:sub>n,n<\/jats:sub><\/jats:italic> such that every copy of <jats:italic>K<\/jats:italic><jats:sub>3,3<\/jats:sub> receives at least three colors on its edges. We prove that\n<jats:disp-formula>\n<jats:styled-content><jats:styled-content>\n$$(0.62+o(1))\\sqrt{n}&lt; \\, f(n)&lt; \\, (1+o(1))\\sqrt{n}$$,\n<\/jats:styled-content><\/jats:styled-content>\n<\/jats:disp-formula>\nwhere the upper bound is obtained by an explicit edge\u2010coloring. This complements earlier results of Axenovich, F\u00fcredi, and Mubayi [1]. \u00a9 2003 Wiley Periodicals, Inc. J Graph Theory 42: 193\u2013198, 2003<\/jats:p>","DOI":"10.1002\/jgt.10083","type":"journal-article","created":{"date-parts":[[2003,2,14]],"date-time":"2003-02-14T14:04:11Z","timestamp":1045231451000},"page":"193-198","source":"Crossref","is-referenced-by-count":2,"title":["Coloring with three\u2010colored subgraphs"],"prefix":"10.1002","volume":"42","author":[{"given":"Dhruv","family":"Mubayi","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2003,1,30]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1999.1948"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1999.1906"},{"key":"e_1_2_1_4_2","doi-asserted-by":"crossref","first-page":"251","DOI":"10.4064\/cm-13-2-251-254","article-title":"On an extremal problem in graph theory","volume":"13","author":"Erd\u0151s P.","year":"1964","journal-title":"Colloq Math"},{"key":"e_1_2_1_5_2","first-page":"49","article-title":"Solved and unsolved problems in combinatorics and combinatorial number theory","volume":"32","author":"Erd\u0151s P","year":"1981","journal-title":"Congressus Numerantum"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01195000"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.1996.0067"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/PL00013410"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1112\/S0025579300006069"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01261323"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.2000.1954"},{"key":"e_1_2_1_12_2","article-title":"On restricted edge\u2010colorings of Bicliques","author":"Mubayi D.","journal-title":"Discrete Math"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.10083","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.10083","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,29]],"date-time":"2023-09-29T15:51:32Z","timestamp":1696002692000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.10083"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1,30]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["10.1002\/jgt.10083"],"URL":"https:\/\/doi.org\/10.1002\/jgt.10083","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,1,30]]}}}