{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T09:43:57Z","timestamp":1698227037854},"reference-count":19,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,10,6]],"date-time":"2006-10-06T00:00:00Z","timestamp":1160092800000},"content-version":"vor","delay-in-days":4480,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1994,7]]},"abstract":"Abstract<\/jats:title>We give constructions of color\u2010critical graphs and hypergraphs with no short cycles and with relatively few edges. In particular, we show that, for each n<\/jats:italic> \u2267 3, the smallest number of edges in a 3\u2010critical triangle\u2010free n<\/jats:italic>\u2010graph (hypergraph) with m<\/jats:italic> vertices is m<\/jats:italic> + o(m)<\/jats:italic> as m<\/jats:italic> \u2192 \u221e. Also, for each r<\/jats:italic> \u2267 4, there exists an r<\/jats:italic>\u2010critical triangle\u2010free 2\u2010graph (graph) with m<\/jats:italic> vertices and at most (r<\/jats:italic> \u2212 (7\/3))m<\/jats:italic> + o(m)<\/jats:italic> edges. Weaker results are obtained for the existence of r<\/jats:italic>\u2010critical graphs containing no cycle of length at most \/ > 3.<\/jats:p>","DOI":"10.1002\/jgt.3190180408","type":"journal-article","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T18:20:52Z","timestamp":1181240452000},"page":"373-388","source":"Crossref","is-referenced-by-count":4,"title":["Sparse color\u2010critical graphs and hypergraphs with no short cycles"],"prefix":"10.1002","volume":"18","author":[{"given":"H. L.","family":"Abbott","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. R.","family":"Hare","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,6]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.4153\/CMB-1969-107-x"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02125892"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01902363"},{"key":"e_1_2_1_5_2","first-page":"285","article-title":"Critical hypergraphs with minimal number of edges","volume":"83","author":"Burstein M. I.","year":"1976","journal-title":"Bull. Acad. Sci. Georgian SSR"},{"key":"e_1_2_1_6_2","first-page":"532","article-title":"Solution to advanced problem No. 4525","volume":"61","author":"Descartes B.","year":"1954","journal-title":"Am. Math. Month."},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-27.1.85"},{"key":"e_1_2_1_8_2","first-page":"609","volume-title":"Infinite and Finite Sets","author":"Erd\u00f6s P.","year":"1975"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1961-029-9"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01504345"},{"key":"e_1_2_1_11_2","first-page":"165","article-title":"Kritische Graphen (2)","volume":"8","author":"Gallai T.","year":"1963","journal-title":"Magyar Tud. Akad. Mat. Kutato Int. Kozl."},{"key":"e_1_2_1_12_2","first-page":"116","article-title":"\u00dcber eine Konstruktion nicht n\u2010farbbarer Graphen","volume":"10","author":"Haj\u00f3s G.","year":"1961","journal-title":"Wiss. Zeit. Martin Luther Univ. Halle\u2010Wittenberg, Math\u2010Natur."},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01456961"},{"key":"e_1_2_1_14_2","unstructured":"A.Liu Some results on hypergraphs. Ph.D. thesis University of Alberta (1976)."},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.4064\/cm-3-2-161-162"},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1093\/qmath\/25.1.303"},{"key":"e_1_2_1_17_2","first-page":"1445","volume-title":"Infinite and Finite Sets","author":"Toft B.","year":"1975"},{"key":"e_1_2_1_18_2","volume-title":"Institut for Mathematik og Datalogi","author":"Toft B.","year":"1987"},{"key":"e_1_2_1_19_2","unstructured":"B.Toft 75 graph coloring problems Graph Coloring. Pitman Research Notes in Mathematics Series. No. 218. Longman's Essex UK. (1990)9\u201335."},{"key":"e_1_2_1_20_2","first-page":"322","volume-title":"Combinatorics","author":"Woodall D. R.","year":"1972"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190180408","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190180408","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T16:22:17Z","timestamp":1698164537000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190180408"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,7]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1994,7]]}},"alternative-id":["10.1002\/jgt.3190180408"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190180408","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,7]]}}}