{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,4]],"date-time":"2023-10-04T07:11:11Z","timestamp":1696403471362},"reference-count":17,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2014,11,10]],"date-time":"2014-11-10T00:00:00Z","timestamp":1415577600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["SCHA 1263\/4-2"],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[2015,9]]},"abstract":"Abstract<\/jats:title>We study minimum degree conditions for which a graph with given odd girth has a simple structure. For example, the classical work of Andr\u00e1sfai, Erd\u0151s, and S\u00f3s implies that every n<\/jats:italic>\u2010vertex graph with odd girth and minimum degree bigger than must be bipartite. We consider graphs with a weaker condition on the minimum degree. Generalizing results of H\u00e4ggkvist and of H\u00e4ggkvist and Jin for the cases and 3, we show that every n<\/jats:italic>\u2010vertex graph with odd girth and minimum degree bigger than is homomorphic to the cycle of length . This is best possible in the sense that there are graphs with minimum degree and odd girth that are not homomorphic to the cycle of length . Similar results were obtained by Brandt and Ribe\u2010Baumann.<\/jats:p>","DOI":"10.1002\/jgt.21840","type":"journal-article","created":{"date-parts":[[2014,11,10]],"date-time":"2014-11-10T18:20:37Z","timestamp":1415643637000},"page":"69-81","source":"Crossref","is-referenced-by-count":2,"title":["On the Structure of Graphs with Given Odd Girth and Large Minimum Degree"],"prefix":"10.1002","volume":"80","author":[{"given":"Silvia","family":"Messuti","sequence":"first","affiliation":[{"name":"FACHBEREICH MATHEMATIK UNIVERSIT\u00c4T HAMBURG BUNDESSTRA\u00dfE\u00a055, HAMBURG GERMANY"}]},{"given":"Mathias","family":"Schacht","sequence":"additional","affiliation":[{"name":"FACHBEREICH MATHEMATIK UNIVERSIT\u00c4T HAMBURG BUNDESSTRA\u00dfE\u00a055, HAMBURG GERMANY"}]}],"member":"311","published-online":{"date-parts":[[2014,11,10]]},"reference":[{"key":"e_1_2_5_2_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190170503"},{"key":"e_1_2_5_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(74)90133-2"},{"key":"e_1_2_5_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0619-4"},{"key":"e_1_2_5_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5"},{"key":"e_1_2_5_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(01)00340-5"},{"key":"e_1_2_5_7_1","first-page":"89","volume-title":"European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2009), Electron. Notes Discrete Math","author":"Brandt St.","year":"2009"},{"key":"e_1_2_5_8_1","article-title":"Dense triangle\u2010free graphs are four colorable: A solution to the Erd\u0151s\u2010Simonovits problem","author":"Brandt St.","journal-title":"submitted"},{"key":"e_1_2_5_9_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548397003167"},{"key":"e_1_2_5_10_1","volume-title":"Graduate Texts in Mathematics","author":"Diestel R.","year":"2010"},{"key":"e_1_2_5_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(73)90126-X"},{"key":"e_1_2_5_12_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190120108"},{"key":"e_1_2_5_13_1","doi-asserted-by":"publisher","DOI":"10.4153\/CMB-1967-046-4"},{"key":"e_1_2_5_14_1","first-page":"89","volume-title":"Odd cycles of specified length in nonbipartite graphs","author":"H\u00e4ggkvist R.","year":"1981"},{"key":"e_1_2_5_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s003730050023"},{"key":"e_1_2_5_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(94)00063-O"},{"key":"e_1_2_5_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-006-0028-8"},{"key":"e_1_2_5_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-002-0009-5"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.21840","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.21840","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,3]],"date-time":"2023-10-03T15:51:03Z","timestamp":1696348263000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.21840"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,10]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["10.1002\/jgt.21840"],"URL":"https:\/\/doi.org\/10.1002\/jgt.21840","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,10]]}}}