{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T15:56:55Z","timestamp":1720713415618},"reference-count":5,"publisher":"Wiley","issue":"6","license":[{"start":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T00:00:00Z","timestamp":1160006400000},"content-version":"vor","delay-in-days":6152,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1989,12]]},"abstract":"Abstract<\/jats:title>We prove the following conjecture of Erd\u00f6s and Hajnal: For any fixed positive integer t and for any 2\u2010coloring of the edges of kn<\/jats:sub>, there exists X \u2282 v(KN<\/jats:sub>) such that |\u2266| and X<\/jats:italic> monochromatically dominates all but at most n\/2t<\/jats:sup> vertices of Kn<\/jats:sub>. In fact, X<\/jats:italic> can be constructed by a fast greedy algorithm.<\/jats:p>","DOI":"10.1002\/jgt.3190130607","type":"journal-article","created":{"date-parts":[[2007,6,8]],"date-time":"2007-06-08T21:35:56Z","timestamp":1181338556000},"page":"713-718","source":"Crossref","is-referenced-by-count":9,"title":["Domination in colored complete graphs"],"prefix":"10.1002","volume":"13","author":[{"given":"P.","family":"Erd\u00f6s","sequence":"first","affiliation":[]},{"given":"R.","family":"Faudree","sequence":"additional","affiliation":[]},{"given":"A.","family":"Gy\u00e1rf\u00e1s","sequence":"additional","affiliation":[]},{"given":"R. H.","family":"Schelp","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,5]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"crossref","DOI":"10.5948\/UPO9780883859216","volume-title":"An Introduction to Inequalities","author":"Beckenbach E. F.","year":"1961"},{"key":"e_1_2_1_3_2","unstructured":"P.Erd\u00f6sandA.Hajnal Ramsey type theorems Preprint (1987)."},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.2307\/3613396"},{"key":"e_1_2_1_5_2","volume-title":"Probabilistic Methods in Combinatorics","author":"Erd\u00f6s P.","year":"1974"},{"key":"e_1_2_1_6_2","unstructured":"H. A.Kierstead private communication."}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190130607","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190130607","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T02:57:31Z","timestamp":1697943451000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190130607"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,12]]},"references-count":5,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1989,12]]}},"alternative-id":["10.1002\/jgt.3190130607"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190130607","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,12]]}}}