{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T03:18:59Z","timestamp":1774063139853,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"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":[[1997,9]]},"DOI":"10.1007\/bf01215921","type":"journal-article","created":{"date-parts":[[2005,2,25]],"date-time":"2005-02-25T15:19:53Z","timestamp":1109344793000},"page":"401-426","source":"Crossref","is-referenced-by-count":25,"title":["On the minimal number of edges in color-critical graphs"],"prefix":"10.1007","volume":"17","author":[{"given":"Michael","family":"Krivelevich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"The probabilistic method","author":"N. Alon","year":"1992","unstructured":"N. Alon andJ. H. Spencer:The probabilistic method, Wiley, New York, 1992."},{"key":"CR2","volume-title":"Random graphs","author":"B. Bollob\u00e1s","year":"1985","unstructured":"B. Bollob\u00e1s:Random graphs, Academic Press, New York, 1985."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0012-365X(91)90042-Z","volume":"87","author":"B. Bollob\u00e1s","year":"1991","unstructured":"B. Bollob\u00e1s andH. R. Hind: Graphs without large triangle-free subgraphs,Discrete Math. 87 (1991), 119?131.","journal-title":"Discrete Math."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1017\/S030500410002168X","volume":"37","author":"R. L. Brooks","year":"1941","unstructured":"R. L. Brooks: On colouring the nodes of a network,Proc. Cambridge Phil. Soc.,37 (1941), 194?197.","journal-title":"Proc. Cambridge Phil. Soc."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1112\/plms\/s3-7.1.161","volume":"7","author":"G. A. Dirac","year":"1957","unstructured":"G. A. Dirac: A theorem of R. L. Brooks and a conjecture of H. Hadwiger, Proc. London Math. Soc.7 (1957), 161?195.","journal-title":"Proc. London Math. Soc."},{"key":"CR6","unstructured":"P. Erd?s: Some new applications of probability methods to combinatorial analysis and graph theory,Proc. 5th S.E. Conf. in Combinatorics, Graph Theory and Computing, (1974), 39?51."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"702","DOI":"10.4153\/CJM-1962-060-4","volume":"14","author":"P. Erd?s","year":"1962","unstructured":"P. Erd?s andC. A. Rogers: The construction of certain graphs,Canad. J. Math.,14 (1962), 702?707.","journal-title":"Canad. J. Math."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1002\/rsa.3240010302","volume":"1","author":"P. Erd?s","year":"1990","unstructured":"P. Erd?s andP. Tetali: Representations of integers as the sum ofk terms,Random Struct. Alg.,1 (1990), 245?261.","journal-title":"Random Struct. Alg."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1007\/BF01504345","volume":"17","author":"M. Fekete","year":"1923","unstructured":"M. Fekete: \u00dcber die Verteilung der Wurzeln bei gewissen algebraischen Gleichungen mit ganzzahligen Koefficienten,Math. Z.,17 (1923), 228?249.","journal-title":"Math. Z."},{"key":"CR10","first-page":"165","volume":"8","author":"T. Gallai","year":"1963","unstructured":"T. Gallai: Kritische Graphen I,Publ. Math. Inst. Hungar. Acad. Sci.,8 (1963), 165?192.","journal-title":"Publ. Math. Inst. Hungar. Acad. Sci."},{"key":"CR11","volume-title":"Graph coloring problems","author":"T. R. Jensen","year":"1995","unstructured":"T. R. Jensen andB. Toft:Graph coloring problems, Wiley, New York, 1995."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF02579219","volume":"4","author":"H. A. Kierstead","year":"1984","unstructured":"H. A. Kierstead, E. Szemer\u00e9di andW. T. Trotter: On coloring graphs with locally small chromatic number,Combinatorica,4 (1984), 183?185.","journal-title":"Combinatorica"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1017\/S0963548300001243","volume":"3","author":"M. Krivelevich","year":"1994","unstructured":"M. Krivelevich:K S -free graphs without largeK r -free subgraphs,Combinat., Probab. Comput.,3 (1994), 349?354.","journal-title":"Combinat., Probab. Comput."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/rsa.3240070204","volume":"7","author":"M. Krivelevich","year":"1995","unstructured":"M. Krivelevich: Bounding Ramsey numbers through large deviation inequalities,Random Struct. Alg.,7 (1995), 145?155.","journal-title":"Random Struct. Alg."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1006\/jctb.1994.1026","volume":"61","author":"N. Linial","year":"1994","unstructured":"N. Linial andYu. Rabinovich: Local and global clique numbers,J. Combin. Theory, Ser. B.,61 (1994), 5?15.","journal-title":"J. Combin. Theory, Ser. B."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01205080","volume":"11","author":"T. Luczak","year":"1991","unstructured":"T. Luczak: A note on the sharp concentration of the chromatic number of random graphs,Combinatorica,11 (1991), 295?297.","journal-title":"Combinatorica"},{"key":"CR17","series-title":"Lecture Notes in Mathematics","volume-title":"Asymptotic theory of finite dimensional normed spaces","author":"V. D. Milman","year":"1986","unstructured":"V. D. Milman andG. Schechtman:Asymptotic theory of finite dimensional normed spaces, Lecture Notes in Mathematics 1200, Springer Verlag, Berlin and New York, 1986."},{"key":"CR18","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S0167-5060(08)70476-X","volume":"41","author":"H. Sachs","year":"1989","unstructured":"H. Sachs andM. Stiebitz: Colour-critical graphs with vertices of low valency,Annals of Discrete Math.,41 (1989), 371?396.","journal-title":"Annals of Discrete Math."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0012-365X(89)90210-0","volume":"74","author":"H. Sachs","year":"1989","unstructured":"H. Sachs andM. Stiebitz: On constructive, methods in the theory of colour-critical graphs,Discrete Math.,74 (1989), 201?226.","journal-title":"Discrete Math."},{"key":"CR20","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1007\/BF02579208","volume":"7","author":"E. Shamir","year":"1987","unstructured":"E. Shamir andJ. Spencer: Sharp concentration of the chromatic number of random graphsG n,p ,Combinatorica,7 (1987), 124?129.","journal-title":"Combinatorica"},{"key":"CR21","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF02579239","volume":"2","author":"M. Stiebitz","year":"1982","unstructured":"M. Stiebitz: Proof of a conjecture of T. Gallai concernign connectivity properties of colour-critical graphs,Combinatorica,2 (1982), 315?323.","journal-title":"Combinatorica"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0095-8956(74)90057-4","volume":"16","author":"B. Toft","year":"1974","unstructured":"B. Toft: Color-critical graphs, and hypergraphs,J. Combin. Theory, Ser. B,16 (1974), 145?161.","journal-title":"J. Combin. Theory, Ser. B"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1002\/(SICI)1097-0118(199602)21:2<219::AID-JGT12>3.0.CO;2-E","volume":"21","author":"D. A. Youngs","year":"1996","unstructured":"D. A. Youngs: 4-Chromatic projective graphs,J Graph Theory,21 (1996), 219?227.","journal-title":"J Graph Theory"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01215921.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01215921\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01215921","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T09:56:46Z","timestamp":1556791006000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01215921"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,9]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,9]]}},"alternative-id":["BF01215921"],"URL":"https:\/\/doi.org\/10.1007\/bf01215921","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,9]]}}}