{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T18:28:05Z","timestamp":1776364085566,"version":"3.51.2"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,8,1]],"date-time":"2013-08-01T00:00:00Z","timestamp":1375315200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s00493-013-2440-1","type":"journal-article","created":{"date-parts":[[2013,11,29]],"date-time":"2013-11-29T12:41:03Z","timestamp":1385728863000},"page":"495-512","source":"Crossref","is-referenced-by-count":2,"title":["Critical graphs without triangles: An optimum density construction"],"prefix":"10.1007","volume":"33","author":[{"given":"Wesley","family":"Pegden","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,1,23]]},"reference":[{"key":"2440_CR1","first-page":"237","volume":"20","author":"S Brandt","year":"1999","unstructured":"S. Brandt: On the structure of dense triangle-free graphs, Combinatorica 20 (1999), 237\u2013245.","journal-title":"Combinatorica"},{"key":"2440_CR2","unstructured":"S. Brandt and S. Thomass\u00e9: Dense triangle-free graphs are 4-colorable: A solution to the Erdos-Simonovits problem, http:\/\/www.lirmm.fr\/~thomasse\/liste\/vega11.pdf ."},{"key":"2440_CR3","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF02579374","volume":"5","author":"M El-Zahar","year":"1985","unstructured":"M. El-Zahar and N. Sauer: The chromatic number of the product of two 4-chromatic graphs is 4, Combinatorica, 5 (1985), 121\u2013126.","journal-title":"Combinatorica"},{"key":"2440_CR4","series-title":"Atti dei Convegni Lincei","first-page":"19","volume-title":"Colloquio Internazionale sulle Teorie Combinatorie (Rome, 1973), Tomo II","author":"P Erd\u0151s","year":"1976","unstructured":"P. Erd\u0151s, D. J. Kleitman and B. L. Rothschild: Asymptotic enumeration of K n-free graphs, in: Colloquio Internazionale sulle Teorie Combinatorie (Rome, 1973), Tomo II, pages 19\u201327. Atti dei Convegni Lincei, No. 17. Accad. Naz. Lincei, Rome, 1976."},{"key":"2440_CR5","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0012-365X(73)90126-X","volume":"5","author":"P Erd\u0151s","year":"1973","unstructured":"P. Erd\u0151s and M. Simonovits: On a valence problem in extremal graph theory, Discrete Mathematics, 5 (1973), 323\u2013334.","journal-title":"Discrete Mathematics"},{"key":"2440_CR6","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1090\/S0002-9904-1946-08715-7","volume":"52","author":"P Erd\u0151s","year":"1946","unstructured":"P. Erd\u0151s and A. H. Stone: On the structure of linear graphs, Bulletin of the American Mathematical Society, 52 (1946), 1087\u20131091.","journal-title":"Bulletin of the American Mathematical Society"},{"key":"2440_CR7","unstructured":"A. Gy\u00e1rf\u00e1s: Personal communication, 2005."},{"key":"2440_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jgt.10165","volume":"46","author":"A Gy\u00e1rf\u00e1s","year":"2004","unstructured":"A. Gy\u00e1rf\u00e1s, T. Jensen and M. Stiebitz: On Graphs With Strongly Independent Color-Classes, Journal of Graph Theory 46 (2004), 1\u201314.","journal-title":"Journal of Graph Theory"},{"key":"2440_CR9","series-title":"Annals of Discrete Mathematics","first-page":"89","volume-title":"Graph Theory","author":"R H\u00e4ggkvist","year":"1982","unstructured":"R. H\u00e4ggkvist: Odd cycles of specified length in nonbipartite graphs, in: Graph Theory, pages 89\u201399. Annals of Discrete Mathematics, Vol. 13. North-Holland, Amsterdam-New York, 1982."},{"key":"2440_CR10","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0012-365X(02)00262-5","volume":"258","author":"T R Jensen","year":"2002","unstructured":"T. R. Jensen: Dense critical and vertex-critical graphs, Discrete Mathematics, 258 (2002), 63\u201384.","journal-title":"Discrete Mathematics"},{"key":"2440_CR11","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0012-365X(94)00063-O","volume":"145","author":"G Jin","year":"1995","unstructured":"G. Jin: Triangle-free four-chromatic graphs, Discrete Mathematics, 145 (1995), 151\u2013170.","journal-title":"Discrete Mathematics"},{"key":"2440_CR12","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/s004930070005","volume":"20","author":"A V Kostochka","year":"2000","unstructured":"A. V. Kostochka and M. Stiebnitz: On the number of edges in colour-critical graphs and hypergraphs, Combinatorica 20 (2000), 521\u2013530.","journal-title":"Combinatorica"},{"key":"2440_CR13","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF02124683","volume":"9","author":"I K\u0159\u00ed\u017e","year":"1989","unstructured":"I. K\u0159\u00ed\u017e: A hypergraph-free construction of highly chromatic graphs without short cycles, Combinatorica 9 (1989), 227\u2013229.","journal-title":"Combinatorica"},{"key":"2440_CR14","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF01894680","volume":"19","author":"L Lov\u00e1sz","year":"1968","unstructured":"L. Lov\u00e1sz: On chromatic number of graphs and set-systems, Acta Math. Hungar. 19 (1968), 59\u201367.","journal-title":"Acta Math. Hungar."},{"key":"2440_CR15","first-page":"317","volume":"45","author":"L Lov\u00e1sz","year":"1983","unstructured":"L. Lov\u00e1sz: Self-dual polytopes and the chromatic number of distance graphs on the sphere, Acta Scientiarum Mathematicarum 45 (1983), 317\u2013323.","journal-title":"Acta Scientiarum Mathematicarum"},{"key":"2440_CR16","doi-asserted-by":"crossref","first-page":"161","DOI":"10.4064\/cm-3-2-161-162","volume":"3","author":"J Mycielski","year":"1955","unstructured":"J. Mycielski: Sur le coloriage des graphes, Colloq. Math., 3 (1955), 161\u2013162.","journal-title":"Colloq. Math."},{"key":"2440_CR17","first-page":"454","volume":"26","author":"A Schrijver","year":"1978","unstructured":"A. Schrijver: Vertex-critical subgraphs of kneser graphs, Nieuw Arch. Wiskd. III. Ser. 26 (1978), 454\u2013461.","journal-title":"Nieuw Arch. Wiskd. III. Ser."},{"key":"2440_CR18","volume-title":"Beitr\u00e4ge zur Theorie der f\u00e4rbungskritschen Graphen","author":"M Stiebitz","year":"1985","unstructured":"M. Stiebitz: Beitr\u00e4ge zur Theorie der f\u00e4rbungskritschen Graphen, PhD thesis, Technical University Ilmenaur, 1985."},{"key":"2440_CR19","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1002\/jgt.1025","volume":"38","author":"C Tardif","year":"2001","unstructured":"C. Tardif: Fractional chromatic numbers of cones over graphs, Journal of Graph Theory 38 (2001), 87\u201394.","journal-title":"Journal of Graph Theory"},{"key":"2440_CR20","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1007\/s00493-002-0009-5","volume":"22","author":"C Thomassen","year":"2002","unstructured":"C. Thomassen: On the chromatic number of triangle-free graphs of large minimum degree, Combinatorica 22 (2002), 591\u2013596.","journal-title":"Combinatorica"},{"key":"2440_CR21","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s00493-007-0054-1","volume":"27","author":"C Thomassen","year":"2007","unstructured":"C. Thomassen: On the chromatic number of pentagon-free graphs of large minimum degree, Combinatorica 27 (2007), 241\u2013243.","journal-title":"Combinatorica"},{"key":"2440_CR22","first-page":"461","volume":"5","author":"B Toft","year":"1970","unstructured":"B. Toft: On the maximal number of edges of critical k-chromatic graphs, Studia Sci. Math. Hungar. 5 (1970), 461\u2013470.","journal-title":"Studia Sci. Math. Hungar."},{"key":"2440_CR23","first-page":"163","volume":"24","author":"A Zykov","year":"1949","unstructured":"A. Zykov: On some properties of linear complexes (in Russian), Matem. Sbornik 24 (1949), 163\u2013187.","journal-title":"Matem. Sbornik"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-013-2440-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-013-2440-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-013-2440-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,4]],"date-time":"2019-08-04T07:31:27Z","timestamp":1564903887000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-013-2440-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["2440"],"URL":"https:\/\/doi.org\/10.1007\/s00493-013-2440-1","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8]]}}}