乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T18:36:18Z","timestamp":1732041378985},"reference-count":20,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2023,4,4]],"date-time":"2023-04-04T00:00:00Z","timestamp":1680566400000},"content-version":"am","delay-in-days":365,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#am"},{"start":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T00:00:00Z","timestamp":1649030400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/V007327\/1"],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN\u20102020\u201003912"],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["A9550\u201019\u20101\u20100187"],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[2022,10]]},"abstract":"Abstract<\/jats:title>The Gy\u00e1rf\u00e1s\u2013Sumner conjecture says that for every forest , there is a function such that if is \u2010free then (where are the chromatic number and the clique number of ). Louis Esperet conjectured that, whenever such a statement holds, can be chosen to be a polynomial. The Gy\u00e1rf\u00e1s\u2013Sumner conjecture is only known to be true for a modest set of forests , and Esperet's conjecture is known to be true for almost no forests. For instance, it is not known when is a five\u2010vertex path. Here we prove Esperet's conjecture when each component of is a star.<\/jats:p>","DOI":"10.1002\/jgt.22829","type":"journal-article","created":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T07:06:18Z","timestamp":1649055978000},"page":"318-322","update-policy":"http:\/\/dx.doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Polynomial bounds for chromatic number II: Excluding a star\u2010forest"],"prefix":"10.1002","volume":"101","author":[{"ORCID":"http:\/\/orcid.org\/0000-0003-4489-5988","authenticated-orcid":false,"given":"Alex","family":"Scott","sequence":"first","affiliation":[{"name":"Mathematical Institute University of Oxford Oxford UK"}]},{"ORCID":"http:\/\/orcid.org\/0000-0003-0067-4534","authenticated-orcid":false,"given":"Paul","family":"Seymour","sequence":"additional","affiliation":[{"name":"Department of Mathematics Princeton University Princeton New Jersey USA"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-2536-5618","authenticated-orcid":false,"given":"Sophie","family":"Spirkl","sequence":"additional","affiliation":[{"name":"Department of Combinatorics and Optimization University of Waterloo Waterloo Ontario Canada"}]}],"member":"311","published-online":{"date-parts":[[2022,4,4]]},"reference":[{"key":"e_1_2_4_2_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.22450"},{"key":"e_1_2_4_3_1","unstructured":"M.Chudnovsky A.Scott P.Seymour andS.Spirkl Erd\u0151s\u2013Hajnal for graphs with no five\u2010hole submitted for publication arXiv:2102.04994."},{"key":"e_1_2_4_4_1","first-page":"\u200b","article-title":"On spanned subgraphs of graphs","author":"Erd\u0151s P.","year":"1977","journal-title":"Graphentheorie und Ihre Anwendungen"},{"key":"e_1_2_4_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(89)90045-0"},{"key":"e_1_2_4_6_1","unstructured":"L.Esperet \u00a0Graph colorings flows and perfect matchings Habilitation thesis Universit\u00e9 Grenoble Alpes \u00a02017 \u00a024.\u00a0https:\/\/tel.archives-ouvertes.fr\/tel-01850463\/document"},{"key":"e_1_2_4_7_1","doi-asserted-by":"crossref","unstructured":"A.Gy\u00e1rf\u00e1s Problems from the world surrounding perfect graphs Proceedings of the International Conference on Combinatorial Analysis and its Applications\u00a0(Pokrzywna 1985) vol. 19 Zastos. Mat. 1987 pp.413\u2013441.","DOI":"10.4064\/am-19-3-4-413-441"},{"key":"e_1_2_4_8_1","unstructured":"A.Gy\u00e1rf\u00e1s On Ramsey covering\u2010numbers Infinite and Finite Sets Vol. II (Colloq. Keszthely 1973) vol. 10 North Holland\/American Elsevier New York. Coll. Math. Soc. J\u00e1nos Bolyai pp.801\u2013816."},{"key":"e_1_2_4_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(80)90230-7"},{"key":"e_1_2_4_10_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190180203"},{"key":"e_1_2_4_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480198339869"},{"key":"e_1_2_4_12_1","unstructured":"X.Liu J.Schroeder Z.Wang andX.Yu Polynomial\u03c7$\\chi $\u2010binding functions fort$t$\u2010broom\u2010free graphs arXiv:2106.08871."},{"key":"e_1_2_4_13_1","doi-asserted-by":"publisher","DOI":"10.7494\/OpMath.2017.37.4.609"},{"key":"e_1_2_4_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-018-1999-0"},{"key":"e_1_2_4_15_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0118(199704)24:4<297::AID-JGT2>3.0.CO;2-J"},{"key":"e_1_2_4_16_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.22601"},{"key":"e_1_2_4_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2019.103024"},{"key":"e_1_2_4_18_1","unstructured":"A.Scott P.Seymour andS.Spirkl Polynomial bounds for chromatic number. III. Excluding a double star in preparation."},{"key":"e_1_2_4_19_1","unstructured":"A.Scott P.Seymour andS.Spirkl Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree submitted for publication.arXiv:2104.07927 arXiv preprint arXiv:2108.07066 2021."},{"key":"e_1_2_4_20_1","first-page":"557","volume-title":"The Theory and Applications of Graphs","author":"Sumner D. P.","year":"1981"},{"key":"e_1_2_4_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(80)90093-3"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.22829","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1002\/jgt.22829","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/am-pdf\/10.1002\/jgt.22829","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.22829","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T15:30:21Z","timestamp":1692718221000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.22829"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,4]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["10.1002\/jgt.22829"],"URL":"https:\/\/doi.org\/10.1002\/jgt.22829","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,4]]},"assertion":[{"value":"2021-07-20","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-03-16","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-04-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}