{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2020,4,23]],"date-time":"2020-04-23T04:10:10Z","timestamp":1587615010866},"publisher-location":"Berlin, Heidelberg","reference-count":132,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540433286","type":"print"},{"value":"9783540458784","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45878-6_3","type":"book-chapter","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T01:21:43Z","timestamp":1181179303000},"page":"84-112","source":"Crossref","is-referenced-by-count":27,"title":["The Regularity Lemma and Its Applications in Graph Theory"],"prefix":"10.1007","author":[{"given":"J\u00e1nos","family":"Koml\u00f3s","sequence":"first","affiliation":[]},{"given":"Ali","family":"Shokoufandeh","sequence":"additional","affiliation":[]},{"given":"Mikl\u00f3s","family":"Simonovits","sequence":"additional","affiliation":[]},{"given":"Endre","family":"Szemer\u00e9di","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,2,21]]},"reference":[{"key":"3_CR1","unstructured":"M. Ajtai, J. Koml\u00f3s, M. Simonovits and E. Szemer\u00e9di, Solution of the Erd\u0151s-S\u00f3s Conjecture, in preparation."},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1006\/jagm.1994.1005","volume":"16","author":"N. Alon","year":"1994","unstructured":"N. Alon, R. Duke, H. Leffman, V. R\u00f6dl, R. Yuster, The algorithmic aspects of the regularity lemma, FOCS 33 (1992), 479-481, Journal of Algorithms 16 (1994), 80\u2013109.","journal-title":"Journal of Algorithms"},{"key":"3_CR3","unstructured":"N. Alon, E. Fischer, 2-factors in dense graphs, Discrete Math."},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF02350627","volume":"8","author":"N. Alon","year":"1992","unstructured":"N. Alon, R. Yuster, Almost H-factors in dense graphs, Graphs and Combinatorics 8 (1992), 95\u2013102.","journal-title":"Graphs and Combinatorics"},{"key":"3_CR5","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1006\/jctb.1996.0020","volume":"B66","author":"N. Alon","year":"1996","unstructured":"N. Alon, R. Yuster, H-factors in dense graphs, J. Combinatorial Theory B66 (1996), 269\u2013282.","journal-title":"J. Combinatorial Theory"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1002\/jgt.3190140511","volume":"14","author":"L. Babai","year":"1990","unstructured":"L. Babai, M. Simonovits, J. Spencer, Extremal subgraphs of random graphs, Journal of Graph Theory 14 (1990), 599\u2013622.","journal-title":"Journal of Graph Theory"},{"key":"3_CR7","unstructured":"V. Bergelson, A. Leibman, Polynomial extension of van der Waerden\u2019s and Szemer\u00e9di\u2019s theorem."},{"key":"3_CR8","author":"B. Bollob\u00e1s","year":"1978","unstructured":"B. Bollob\u00e1s, Extremal graph theory, Academic Press, London (1978).","volume-title":"Extremal graph theory"},{"key":"3_CR9","unstructured":"B\u00e9la Bollob\u00e1s, The work of William Timothy Gowers, Proceedings of the International Congress of Mathematicians, Vol. I (Berlin, 1998), Doc. Math. 1998, Extra Vol. I, 109-118 (electronic)."},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/0095-8956(76)90057-5","volume":"B21","author":"B. Bollob\u00e1s","year":"1976","unstructured":"B. Bollob\u00e1s, P. Erd\u0151s, On a Ramsey-Tur\u00e1n type problem, Journal of Combinatorial Theory B21 (1976), 166\u2013168.","journal-title":"Journal of Combinatorial Theory"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0167-5060(08)70495-3","volume":"3","author":"B. Bollob\u00e1s","year":"1978","unstructured":"B. Bollob\u00e1s, P. Erd\u0151s, M. Simonovits, E. Szemer\u00e9di, Extremal graphs without large forbidden subgraphs, Annals of Discrete Mathematics 3 (1978), 29\u201341, North-Holland.","journal-title":"Annals of Discrete Mathematics"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s004930070019","volume":"20","author":"B. Bollob\u00e1s","year":"2000","unstructured":"B. Bollob\u00e1s, A. Thomason, The structure of hereditary properties and colourings of random graphs. Combinatorica 20 (2000), 173\u2013202.","journal-title":"Combinatorica"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0095-8956(73)90034-8","volume":"B15","author":"W. G. Brown","year":"1973","unstructured":"W. G. Brown, P. Erd\u0151s, M. Simonovits, Extremal problems for directed graphs, Journal of Combinatorial Theory B15 (1973), 77\u201393.","journal-title":"Journal of Combinatorial Theory"},{"key":"3_CR14","first-page":"119","volume":"37","author":"W. G. Brown","year":"1981","unstructured":"W. G. Brown, P. Erd\u0151s, M. Simonovits, Inverse extremal digraph problems, Colloq. Math. Soc. J. Bolyai 37 (Finite and Infinite Sets), Eger (Hungary) 1981, Akad. Kiad\u00f3, Budapest (1985), 119\u2013156.","journal-title":"Colloq. Math. Soc. J. Bolyai"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"421","DOI":"10.2307\/2000222","volume":"292\/2","author":"W. G. Brown","year":"1985","unstructured":"W. G. Brown, P. Erd\u0151s, M. Simonovits, Algorithmic solution of extremal digraph problems, Transactions of the American Math. Soc. 292\/2 (1985), 421\u2013449.","journal-title":"Transactions of the American Math. Soc."},{"key":"3_CR16","unstructured":"W. G. Brown, P. Erd\u0151s, V. T. S\u00f3s, Some extremal problems on r-graphs, New directions in the theory of graphs (Proc. Third Ann Arbor Conf., Univ. Michigan, Ann Arbor, Mich, 1971), 53\u201363. Academic Press, New York, 1973."},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/BF02018585","volume":"3","author":"W. G. Brown","year":"1973","unstructured":"W. G. Brown, P. Erd\u0151s, V. T. S\u00f3s, On the existence of triangulated spheres in 3-graphs, and related problems, Period. Math. Hungar. 3 (1973), 221\u2013228.","journal-title":"Period. Math. Hungar"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0012-365X(84)90178-X","volume":"48","author":"W. G. Brown","year":"1984","unstructured":"W. G. Brown, M. Simonovits, Digraph extremal problems, hypergraph extremal problems, and densities of graph structures, Discrete Mathematics 48 (1984), 147\u2013162.","journal-title":"Discrete Mathematics"},{"key":"3_CR19","unstructured":"S. Burr, P. Erd\u0151s, P. Frankl, R. L. Graham, V. T. S\u00f3s, Further results on maximal antiramsey graphs, Proc. Kalamazoo Combin. Conf. (1989), 193\u2013206."},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1002\/jgt.3190130302","volume":"13","author":"S. Burr","year":"1989","unstructured":"S. Burr, P. Erd\u0151s, R. L. Graham, V. T. S\u00f3s, Maximal antiramsey graphs and the strong chromatic number (The nonbipartite case) Journal of Graph Theory 13 (1989), 163\u2013182.","journal-title":"Journal of Graph Theory"},{"key":"3_CR21","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0012-365X(79)90129-8","volume":"28","author":"L. Caccetta","year":"1979","unstructured":"L. Caccetta, R. H\u00e4ggkvist, On diameter critical graphs, Discrete Mathematics 28 (1979), 223\u2013229.","journal-title":"Discrete Mathematics"},{"key":"3_CR22","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1002\/rsa.3240020208","volume":"2","author":"F. R. K. Chung","year":"1991","unstructured":"Fan R. K. Chung, Regularity lemmas for hypergraphs and quasi-randomness, Random Structures and Algorithms 2 (1991), 241\u2013252.","journal-title":"Random Structures and Algorithms"},{"key":"3_CR23","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF02125347","volume":"9","author":"F. R. K. Chung","year":"1989","unstructured":"F. R. K. Chung, R. L. Graham, R. M. Wilson, Quasi-random graphs, Combinatorica 9 (1989), 345\u2013362.","journal-title":"Combinatorica"},{"key":"3_CR24","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0095-8956(83)90037-0","volume":"B34","author":"V. Chv\u00e1tal","year":"1983","unstructured":"V. Chv\u00e1tal, V. R\u00f6dl, E. Szemer\u00e9di, W. T. Trotter Jr., The Ramsey number of a graph with bounded maximum degree, Journal of Combinatorial Theory B34 (1983), 239\u2013243.","journal-title":"Journal of Combinatorial Theory"},{"key":"3_CR25","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1112\/jlms\/s2-23.2.207","volume":"23","author":"V. Chv\u00e1tal","year":"1981","unstructured":"V. Chv\u00e1tal, E. Szemer\u00e9di, On the Erd\u0151s-Stone theorem, Journal of the London Math. Soc. 23 (1981), 207\u2013214.","journal-title":"Journal of the London Math. Soc."},{"key":"3_CR26","first-page":"183","volume":"17","author":"V. Chv\u00e1tal","year":"1983","unstructured":"V. Chv\u00e1tal, E. Szemer\u00e9di, Notes on the Erd\u0151s-Stone theorem, Combinatorial Mathematics, Annals of Discrete Mathematics 17 (1983), (Marseille-Luminy, 1981), 183\u2013190, North-Holland, Amsterdam-New York, 1983.","journal-title":"Annals of Discrete Mathematics"},{"key":"3_CR27","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/BF01895727","volume":"14","author":"K. Corr\u00e1di","year":"1963","unstructured":"K. Corr\u00e1di, A. Hajnal, On the maximal number of independent circuits in a graph, Acta Math. Acad. Sci. Hung. 14 (1963), 423\u2013439.","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"3_CR28","first-page":"323","volume":"10","author":"W. Deuber","year":"1974","unstructured":"W. Deuber, Generalizations of Ramsey\u2019s theorem, Proc. Colloq. Math. Soc. J\u00e1nos Bolyai 10 (1974), 323\u2013332.","journal-title":"Proc. Colloq. Math. Soc. J\u00e1nos Bolyai"},{"key":"3_CR29","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1112\/plms\/s3-2.1.69","volume":"2","author":"G. A. Dirac","year":"1952","unstructured":"G. A. Dirac, Some theorems on abstract graphs, Proc. London Math. Soc. 2 (1952), 68\u201381.","journal-title":"Proc. London Math. Soc."},{"key":"3_CR30","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1137\/S0097539793247634","volume":"24","author":"R. A. Duke","year":"1995","unstructured":"Duke, Richard A., Hanno Lefmann, Hanno, Vojt\u011bch R\u00f6dl, A fast approximation algorithm for computing the frequencies of subgraphs in a given graph, SIAM J. Comput. 24 (1995), 598\u2013620.","journal-title":"SIAM J. Comput."},{"key":"3_CR31","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF02582932","volume":"1","author":"R. A. Duke","year":"1985","unstructured":"R. A. Duke, V. R\u00f6dl, On graphs with small subgraphs of large chromatic number, Graphs Combin. 1 (1985), 91\u201396.","journal-title":"Graphs Combin."},{"key":"3_CR32","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/0097-3165(94)90022-1","volume":"A65","author":"R. A. Duke","year":"1994","unstructured":"R. A. Duke, V. R\u00f6dl, The Erd\u00f6s-Ko-Rado theorem for small families, J. Combin. Theory Ser. A65 (1994), 246\u2013251.","journal-title":"J. Combin. Theory Ser."},{"key":"3_CR33","unstructured":"P. Erd\u0151s, Some recent results on extremal problems in graph theory, Results, International Symposium, Rome (1966), 118\u2013123."},{"key":"3_CR34","unstructured":"P. Erd\u0151s, On some new inequalities concerning extremal properties of graphs, Theory of Graphs, Proc. Coll. Tihany, Hungary (P. Erd\u0151s and G. Katona eds.) Acad. Press N. Y. (1968), 77\u201381."},{"key":"3_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0012-365X(71)90002-1","volume":"1","author":"P. Erd\u0151s","year":"1971","unstructured":"P. Erd\u0151s, On some extremal problems on r-graphs, Discrete Mathematics 1 (1971), 1\u20136.","journal-title":"Discrete Mathematics"},{"key":"3_CR36","first-page":"19","volume":"I","author":"P. Erd\u0151s","year":"1979","unstructured":"P. Erd\u0151s, Some old and new problems in various branches of combinatorics, Proc. 10th Southeastern Conf. on Combinatorics, Graph Theory and Computation, Boca Raton (1979) Vol I., Congressus Numerantium 23 (1979), 19\u201337.","journal-title":"Congressus Numerantium"},{"key":"3_CR37","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF02579174","volume":"1","author":"P. Erd\u0151s","year":"1981","unstructured":"P. Erd\u0151s, On the combinatorial problems which I would most like to see solved, Combinatorica 1 (1981), 25\u201342.","journal-title":"Combinatorica"},{"key":"3_CR38","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF01788085","volume":"2","author":"P. Erd\u0151s","year":"1986","unstructured":"P. Erd\u0151s, P. Frankl, V. R\u00f6dl, The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent, Graphs and Combinatorics 2 (1986), 113\u2013121.","journal-title":"Graphs and Combinatorics"},{"key":"3_CR39","unstructured":"P. Erd\u0151s, Z. F\u00fcredi, M. Loebl, V. T. S\u00f3s, Studia Sci. Math. Hung. 30 (1995), 47\u201357. (Identical with the book Combinatorics and its applications to regularity and irregularity of structures, W. A. Deuber and V. T. S\u00f3s eds., Akad\u00e9miai Kiad\u00f3, 47-58.)"},{"key":"3_CR40","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF02024498","volume":"10","author":"P. Erd\u0151s","year":"1959","unstructured":"P. Erd\u0151s, T. Gallai, On maximal paths and circuits of graphs, Acta Math. Acad. Sci. Hung. 10 (1959), 337\u2013356.","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"3_CR41","first-page":"193","volume":"7","author":"P. Erd\u0151s","year":"1969","unstructured":"P. Erd\u0151s, A. Hajnal, On complete topological subgraphs of certain graphs, Annales Univ. Sci. Budapest 7 (1969), 193\u2013199.","journal-title":"Annales Univ. Sci. Budapest"},{"key":"3_CR42","first-page":"585","volume":"10","author":"P. Erd\u0151s","year":"1975","unstructured":"P. Erd\u0151s, A. Hajnal, L. P\u00f3sa, Strong embedding of graphs into colored graphs, Proc. Colloq. Math. Soc. J\u00e1nos Bolyai 10 (1975), 585\u2013595.","journal-title":"Proc. Colloq. Math. Soc. J\u00e1nos Bolyai"},{"key":"3_CR43","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF01202788","volume":"13","author":"P. Erd\u0151s","year":"1993","unstructured":"P. Erd\u0151s, A. Hajnal, M. Simonovits, V. T. S\u00f3s, E. Szemer\u00e9di, Tur\u00e1n-Ramsey theorems and simple asymptotically extremal structures, Combinatorica 13 (1993), 31\u201356.","journal-title":"Combinatorica"},{"key":"3_CR44","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1017\/S0963548300001218","volume":"3","author":"P. Erd\u0151s","year":"1994","unstructured":"P. Erd\u0151s, A. Hajnal, M. Simonovits, V. T. S\u00f3s, E. Szemer\u00e9di, Tur\u00e1n-Ramsey theorems for Kp-stability numbers, Proc. Cambridge, also in Combinatorics, Probability and Computing 3 (1994) (P. Erd\u0151s birthday meeting), 297\u2013325.","journal-title":"Proc. Cambridge, also in Combinatorics, Probability and Computing"},{"key":"3_CR45","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/BF02579342","volume":"3","author":"P. Erd\u0151s","year":"1983","unstructured":"P. Erd\u0151s, A. Hajnal, V. T. S\u00f3s, E. Szemer\u00e9di, More results on Ramsey-Tur\u00e1n type problems, Combinatorica 3 (1983), 69\u201381.","journal-title":"Combinatorica"},{"key":"3_CR46","first-page":"51","volume":"1","author":"P. Erd\u0151s","year":"1966","unstructured":"P. Erd\u0151s, M. Simonovits, A limit theorem in graph theory, Studia Sci. Math. Hung. 1 (1966), 51\u201357.","journal-title":"Studia Sci. Math. Hung."},{"key":"3_CR47","first-page":"229","volume":"9","author":"P. Erd\u0151s","year":"1980","unstructured":"P. Erd\u0151s, M. Simonovits, The chromatic properties of geometric graphs, Ars Combinatoria 9 (1980), 229\u2013246.","journal-title":"Ars Combinatoria"},{"key":"3_CR48","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF02579292","volume":"3","author":"P. Erd\u0151s","year":"1983","unstructured":"P. Erd\u0151s, M. Simonovits, Supersaturated graphs and hypergraphs, Combinatorica 3 (1983), 181\u2013192.","journal-title":"Combinatorica"},{"key":"3_CR49","unstructured":"P. Erd\u0151s, M. Simonovits, How many colours are needed to colour every pentagon of a graph in five colours? (to be published)."},{"key":"3_CR50","unstructured":"P. Erd\u0151s, V. T. S\u00f3s, The tree conjecture, Mentioned in P. Erd\u0151s, Extremal problems in graph theory, Theory of graphs and its applications, Proc. of the Symposium held in Smolenice in June 1963, 29\u201338."},{"key":"3_CR51","first-page":"395","volume":"II","author":"P. Erd\u0151s","year":"1970","unstructured":"P. Erd\u0151s, V. T. S\u00f3s, Some remarks on Ramsey\u2019s and Tur\u00e1n\u2019s theorem, Combinatorial theory and its applications, II (Proc. Colloq., Balatonf\u00fcred, 1969), 395\u2013404, North-Holland, Amsterdam, 1970.","journal-title":"Combinatorial theory and its applications"},{"key":"3_CR52","first-page":"1089","volume":"52","author":"P. Erd\u0151s","year":"1946","unstructured":"P. Erd\u0151s, A. H. Stone, On the structure of linear graphs, Bull. Amer. Math. Soc. 52 (1946), 1089\u20131091.","journal-title":"Bull. Amer. Math. Soc."},{"key":"3_CR53","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1112\/jlms\/s1-11.4.261","volume":"11","author":"P. Erd\u0151s","year":"1936","unstructured":"P. Erd\u0151s, P. Tur\u00e1n, On some sequences of integers, J. London Math. Soc. 11 (1936), 261\u2013264.","journal-title":"J. London Math. Soc."},{"key":"3_CR54","unstructured":"G. Fan, R. H\u00e4ggkvist, The square of a hamiltonian cycle, SIAM J. Disc. Math."},{"key":"3_CR55","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1006\/jctb.1995.1005","volume":"B63","author":"G. Fan","year":"1995","unstructured":"G. Fan, H. A. Kierstead, The square of paths and cycles, Journal of Combinatorial Theory B63 (1995), 55\u201364.","journal-title":"Journal of Combinatorial Theory"},{"key":"3_CR56","unstructured":"G. Fan, H. A. Kierstead, The square of paths and cycles II."},{"key":"3_CR57","unstructured":"R. J. Faudree, R. J. Gould, M. Jacobson, On a problem of P\u00f3sa and Seymour."},{"key":"3_CR58","unstructured":"R. J. Faudree, R. J. Gould, M. S. Jacobson, R. H. Schelp, Seymour\u2019s conjecture, Advances in Graph Theory (V. R. Kulli ed.), Vishwa International Publications (1991), 163\u2013171."},{"key":"3_CR59","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/0097-3165(87)90016-1","volume":"A45","author":"P. Frankl","year":"1987","unstructured":"P. Frankl, Z. F\u00fcredi, Exact solution of some Tur\u00e1n-type problems, Journal of Combinatorial Theory A45 (1987), 226\u2013262.","journal-title":"Journal of Combinatorial Theory"},{"key":"3_CR60","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1002\/jgt.3190120407","volume":"12","author":"P. Frankl","year":"1988","unstructured":"P. Frankl, J. Pach, An extremal problem on Kr-free graphs, Journal of Graph Theory 12 (1988), 519\u2013523.","journal-title":"Journal of Graph Theory"},{"key":"3_CR61","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/BF02351586","volume":"8","author":"P. Frankl","year":"1992","unstructured":"P. Frankl, V. R\u00f6dl, The Uniformity Lemma for hypergraphs, Graphs and Combinatorics 8 (1992), 309\u2013312.","journal-title":"Graphs and Combinatorics"},{"key":"3_CR62","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s004930050052","volume":"19","author":"A. Frieze","year":"1999","unstructured":"Alan Frieze, Ravi Kannan, Quick approximation to matrices and applications, Combinatorica 19 (1999), 175\u2013220.","journal-title":"Combinatorica"},{"key":"3_CR63","unstructured":"Alan Frieze, Ravi Kannan, A simple algorithm for constructing Szemer\u00e9di\u2019s regularity partition, Electron. J. Combin. 6 (1999), Research Paper 17 (electronic).","DOI":"10.37236\/1449","doi-asserted-by":"crossref"},{"key":"3_CR64","unstructured":"Z. F\u00fcredi, Tur\u00e1n type problems, in Surveys in Combinatorics (1991), Proc. of the 13th British Combinatorial Conference, (A. D. Keedwell ed.) Cambridge Univ. Press. London Math. Soc. Lecture Note Series 166 (1991), 253\u2013300."},{"key":"3_CR65","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1002\/jgt.3190160110","volume":"16","author":"Z. F\u00fcredi","year":"1992","unstructured":"Z. F\u00fcredi, The maximum number of edges in a minimal graph of diameter 2, Journal of Graph Theory 16 (1992), 81\u201398.","journal-title":"Journal of Graph Theory"},{"key":"3_CR66","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/BF02813304","volume":"31","author":"H. Fcurstenberg","year":"1977","unstructured":"H. Fcurstenberg, Ergodic behavior of diagonal measures and a theorem of Szemer\u00e9di on arithmetic progressions, Journal d\u2019Analyse Math. 31 (1977), 204\u2013256.","journal-title":"Journal d\u2019Analyse Math."},{"key":"3_CR67","first-page":"1","volume":"2","author":"H. F\u00fcrstenberg","year":"1993","unstructured":"H. F\u00fcrstenberg, A polynomial Szemer\u00e9di theorem, Combinatorics, Paul Erd\u0151s is eighty, Vol. 2 (Keszthely, 1993), 1\u201316, Bolyai Soc. Math. Stud., 2, J\u00e1nos Bolyai Math. Soc., Budapest, 1996","journal-title":"Bolyai Soc. Math. Stud."},{"key":"3_CR68","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/BF02764984","volume":"68","author":"H. F\u00fcrstenberg","year":"1989","unstructured":"H. F\u00fcrstenberg, Y. Katznelson, Idempotents in compact semigroups and Ramsey theory, Israel Journal of Mathematics 68 (1989), 257\u2013270.","journal-title":"Israel Journal of Mathematics"},{"key":"3_CR69","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1007\/BF03041066","volume":"57","author":"H. F\u00fcrstenberg","year":"1991","unstructured":"H. F\u00fcrstenberg, Y. Katznelson, A density version of the Hales-Jewett theorem, Journal d'Analyse Math. 57 (1991), 64\u2013119.","journal-title":"Journal d'Analyse Math."},{"key":"3_CR70","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/PL00001621","volume":"7","author":"W. T. Gowers","year":"1997","unstructured":"W. T. Gowers, Lower bounds of tower type for Szemer\u00e9di\u2019s uniformity lemma, Geom. Funct. Anal. 7 (1997), 322\u2013337.","journal-title":"Geom. Funct. Anal."},{"key":"3_CR71","unstructured":"R. L. Graham, B. L. Rothschild, J. Spencer, Ramsey Theory, Wiley Interscience, Series in Discrete Mathematics (1980)."},{"key":"3_CR72","unstructured":"A. Hajnal, W. Maass, Gy. Tur\u00e1n, On the communication complexity of graph properties, 20th STOC, Chicago (1988), 186\u2013191.","DOI":"10.1145\/62212.62228","doi-asserted-by":"crossref"},{"key":"3_CR73","unstructured":"A. Hajnal, E. Szemer\u00e9di, Proof of a conjecture of Erd\u0151s, Combinatorial Theory and its Applications vol. II (P. Erd\u0151s, A. R\u00e9nyi and V. T. S\u00f3s eds.), Colloq. Math. Soc. J. Bolyai 4, North-Holland, Amsterdam (1970), 601\u2013623."},{"key":"3_CR74","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02808204","volume":"89","author":"P. E. Haxell","year":"1995","unstructured":"P. E. Haxell, Y. Kohayakawa, The size-Ramsey number of trees, Israel J. Math. 89 (1995), 261\u2013274.","journal-title":"Israel J. Math."},{"key":"3_CR75","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1002\/rsa.3240060405","volume":"6","author":"P. E. Haxell","year":"1995","unstructured":"P. E. Haxell, Y. Kohayakawa, On an anti-Ramsey property of Ramanujan graphs, Random Structures and Algorithms 6 (1995), 417\u2013431.","journal-title":"Random Structures and Algorithms"},{"key":"3_CR76","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1017\/S0963548300001619","volume":"4","author":"P. E. Haxell","year":"1995","unstructured":"P. E. Haxell, Y. Kohayakawa, T. Luczak, The induced size-Ramsey number of cycles, Combinatorics, Probability and Computing 4 (1995), 217\u2013239.","journal-title":"Combinatorics, Probability and Computing"},{"key":"3_CR77","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1006\/jctb.1995.1035","volume":"B64","author":"P. E. Haxell","year":"1995","unstructured":"P. E. Haxell, Y. Kohayakawa, T. Luczak, Tur\u00e1n\u2019s extremal problem in random graphs: forbidding even cycles, Journal of Combinatorial Theory B64 (1995), 273\u2013287.","journal-title":"Journal of Combinatorial Theory"},{"key":"3_CR78","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF01300129","volume":"16","author":"P. E. Haxell","year":"1996","unstructured":"P. E. Haxell, Y. Kohayakawa, T. Luczak, Tur\u00e1n\u2019s extremal problem in random graphs: forbidding odd cycles, Combinatorica 16 (1996), 107\u2013122.","journal-title":"Combinatorica"},{"key":"3_CR79","unstructured":"P. E. Haxell, T. Luczak, P. W. Tingley, Ramsey Numbers for Trees of Small Maximum Degree."},{"key":"3_CR80","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1112\/jlms\/s2-35.3.385","volume":"35","author":"D. R. Heath-Brown","year":"1987","unstructured":"D. R. Heath-Brown, Integer sets containing no arithmetic progressions, J. London Math. Soc. 35 (1987), 385\u2013394.","journal-title":"J. London Math. Soc."},{"key":"3_CR81","unstructured":"Y. Kohayakawa, The Regularity Lemma of Szemer\u00e9di for sparse graphs, manuscript, August 1993."},{"key":"3_CR82","unstructured":"Y. Kohayakawa, Szemer\u00e9di\u2019s regularity lemma for sparse graphs, Foundations of computational mathematics (Rio de Janeiro) (1997), 216\u2013230, Springer, Berlin.","DOI":"10.1007\/978-3-642-60539-0_16","doi-asserted-by":"crossref"},{"key":"3_CR83","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1002\/(SICI)1098-2418(199710)11:3<245::AID-RSA3>3.0.CO;2-0","volume":"11","author":"Y. Kohayakawa","year":"1997","unstructured":"Y. Kohayakawa, B. Kreuter, Threshold functions for asymmetric Ramsey properties involving cycles, Random Structures Algorithms 11 (1997), 245\u2013276.","journal-title":"Random Structures Algorithms"},{"key":"3_CR84","doi-asserted-by":"crossref","first-page":"133","DOI":"10.4064\/aa-75-2-133-163","volume":"75","author":"Y. Kohayakawa","year":"1996","unstructured":"Y. Kohayakawa, T. Luczak, V. R\u00f6dl, Arithmetic progressions of length three in subsets of a random set, Acta Arithmetica, 75 (1996), 133\u2013163.","journal-title":"Acta Arithmetica"},{"key":"3_CR85","doi-asserted-by":"crossref","first-page":"133","DOI":"10.4064\/aa-75-2-133-163","volume":"75","author":"Y. Kohayakawa","year":"1996","unstructured":"Y. Kohayakawa, T. Luczak, V. R\u00f6dl, Arithmetic progressions of length three in subsets of a random set, Acta Arith. 75 (1996), 133\u2013163.","journal-title":"Acta Arith."},{"key":"3_CR86","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF01200906","volume":"17","author":"Y. Kohayakawa","year":"1997","unstructured":"Y. Kohayakawa, T. Luczak, V. R\u00f6dl, On K 4-free subgraphs of random graphs, Combinatorica 17 (1997), 173\u2013213.","journal-title":"Combinatorica"},{"key":"3_CR87","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1017\/S0963548398003502","volume":"8","author":"J. Koml\u00f3s","year":"1999","unstructured":"J. Koml\u00f3s, The blow-up lemma, Recent trends in combinatorics (M\u00e1trah\u00e1za, 1995), Combin. Probab. Comput. 8 (1999), 161\u2013176.","journal-title":"Combin. Probab. Comput."},{"key":"3_CR88","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s004930070020","volume":"20","author":"J. Koml\u00f3s","year":"2000","unstructured":"J. Koml\u00f3s, Tiling Tur\u00e1n Theorems, Combinatorica 20 (2000), 203\u2013218.","journal-title":"Combinatorica"},{"key":"3_CR89","unstructured":"J. Koml\u00f3s, G. N. S\u00e1rk\u00f6zy, E. Szemer\u00e9di, Proof of a packing conjecture of Bollob\u00e1s, AMS Conference on Discrete Mathematics, DeKalb, Illinois (1993), Combinatorics, Probability and Computing 4 (1995), 241\u2013255.","DOI":"10.1017\/S0963548300001620","doi-asserted-by":"crossref"},{"key":"3_CR90","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1002\/(SICI)1098-2418(199608\/09)9:1\/2<193::AID-RSA12>3.0.CO;2-P","volume":"9","author":"J. Koml\u00f3s","year":"1995","unstructured":"J. Koml\u00f3s, G. N. S\u00e1rk\u00f6zy, E. Szemer\u00e9di, On the square of a Hamiltonian cycle in dense graphs, Proceedings of the Seventh International Conference on Random Structures and Algorithms (Atlanta, GA, 1995), Random Structures and Algorithms 9 (1996), 193\u2013211.","journal-title":"Proceedings of the Seventh International Conference on Random Structures and Algorithms"},{"key":"3_CR91","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01196135","volume":"17","author":"J. Koml\u00f3s","year":"1997","unstructured":"J. Koml\u00f3s, G. N. S\u00e1rk\u00f6zy, E. Szemer\u00e9di, Blow-up Lemma, Combinatorica 17 (1997), 109\u2013123.","journal-title":"Combinatorica"},{"key":"3_CR92","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1002\/(SICI)1098-2418(199805)12:3<297::AID-RSA5>3.0.CO;2-Q","volume":"12","author":"J. Koml\u00f3s","year":"1998","unstructured":"J. Koml\u00f3s, G. N. S\u00e1rk\u00f6zy, E. Szemer\u00e9di, An algorithmic version of the blow-up lemma, Random Structures Algorithms 12 (1998), 297\u2013312.","journal-title":"Random Structures Algorithms"},{"key":"3_CR93","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1002\/(SICI)1097-0118(199811)29:3<167::AID-JGT4>3.0.CO;2-O","volume":"29","author":"J. Koml\u00f3s","year":"1998","unstructured":"J. Koml\u00f3s, G. N. S\u00e1rk\u00f6zy, E. Szemer\u00e9di, On the P\u00f3sa-Seymour conjecture, J. Graph Theory 29 (1998), 167\u2013176.","journal-title":"J. Graph Theory"},{"key":"3_CR94","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BF01626028","volume":"2","author":"J. Koml\u00f3s","year":"1998","unstructured":"J\u00e1nos Koml\u00f3s, G\u00e1bor S\u00e1rk\u00f6zy, Endre Szemer\u00e9di, Proof of the Seymour conjecture for large graphs, Ann. Comb. 2 (1998), 43\u201360.","journal-title":"Ann. Comb."},{"key":"3_CR95","unstructured":"J. Koml\u00f3s, G. N. S\u00e1rk\u00f6zy, E. Szemer\u00e9di, Proof of the Alon-Yuster conjecture, Random Structures and Algorithms."},{"key":"3_CR96","unstructured":"J. Koml\u00f3s, M. Simonovits,Szemer\u00e9di\u2019s regularity lemma and its applications in graph theory, Bolyai Society Mathematical Studies 2, Combinatorics, Paul Erd\u0151s is Eighty (Volume 2) (D. Mikl\u00f3s, V. T. S\u00f3s, T. Sz\u0151nyi eds.), Keszthely (Hungary) (1993), Budapest (1996), 295\u2013352."},{"key":"3_CR97","unstructured":"L. Lov\u00e1sz, M. Simonovits, On the number of complete subgraphs of a graph I, Proc. Fifth British Combin. Conf. Aberdeen (1975), 431\u2013442."},{"key":"3_CR98","unstructured":"L. Lov\u00e1sz, M. Simonovits, On the number of complete subgraphs of a graph II, Studies in Pure Math (dedicated to the memory of P. Tur\u00e1n), Akad\u00e9miai Kiad\u00f3 and Birkh\u00e4user Verlag (1983), 459\u2013495.","DOI":"10.1007\/978-3-0348-5438-2_41","doi-asserted-by":"crossref"},{"key":"3_CR99","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1006\/jctb.1998.1874","volume":"B75","author":"T. Luczak","year":"1999","unstructured":"T. Luczak, R(C n , C n , C n ) \u2264 (4 + o(1))n, J. Combin. Theory B75 (1999), 174\u2013187.","journal-title":"J. Combin. Theory"},{"key":"3_CR100","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1017\/S0963548398003599","volume":"7","author":"T. Luczak","year":"1998","unstructured":"Luczak, Tomasz; R\u00f6dl, Vojt\u011bch; Szemer\u00e9di, Endre, Partitioning two-coloured complete graphs into two monochromatic cycles, Combin. Probab. Comput. 7 (1998), 423\u2013436.","journal-title":"Combin. Probab. Comput."},{"key":"3_CR101","unstructured":"J. Ne\u0161et\u0159il, V. R\u00f6dl, Partition theory and its applications, in Surveys in Combinatorics (Proc. Seventh British Combinatorial Conf., Cambridge, 1979), pp. 96\u2013156, (B. Bollob\u00e1s ed.), London Math. Soc. Lecture Notes Series, Cambridge Univ. Press, Cambridge-New York, 1979.","DOI":"10.1017\/CBO9780511662133.006","doi-asserted-by":"crossref"},{"key":"3_CR102","unstructured":"P. Pudl\u00e1k, J. Sgall, An upper bound for a communication game, related to time-space tradeoffs, Electronic Colloquium on Computational Complexity, TR 95-010, (1995)."},{"key":"3_CR103","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1112\/jlms\/s1-29.1.20","volume":"29","author":"K. F. Roth","year":"1954","unstructured":"K. F. Roth, On certain sets of integers (II), J. London Math. Soc. 29 (1954), 20\u201326.","journal-title":"J. London Math. Soc."},{"key":"3_CR104","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0022-314X(70)90013-2","volume":"2","author":"K. F. Roth","year":"1970","unstructured":"K. F. Roth, Irregularities of sequences relative to arithmetic progressions (III), Journal of Number Theory 2 (1970), 125\u2013142.","journal-title":"Journal of Number Theory"},{"key":"3_CR105","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF02018670","volume":"2","author":"K. F. Roth","year":"1972","unstructured":"K. F. Roth, Irregularities of sequences relative to arithmetic progressions (IV), Periodica Math. Hung. 2 (1972), 301\u2013326.","journal-title":"Periodica Math. Hung."},{"key":"3_CR106","unstructured":"V. R\u00f6dl, A generalization of Ramsey Theorem and dimension of graphs, Thesis, 1973, Charles Univ. Prague; see also: A generalization of Ramsey Theorem for graphs, hypergraphs and block systems, Zielona Gora (1976), 211\u2013220."},{"key":"3_CR107","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0012-365X(86)90076-2","volume":"59","author":"V. R\u00f6dl","year":"1986","unstructured":"V. R\u00f6dl, On universality of graphs with uniformly distributed edges, Discrete Mathematics 59 (1986), 125\u2013134.","journal-title":"Discrete Mathematics"},{"key":"3_CR108","unstructured":"V. R\u00f6dl, Sparse Regularity, Personal communication."},{"key":"3_CR109","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1002\/rsa.3240050202","volume":"5","author":"V. R\u00f6dl","year":"1994","unstructured":"V. R\u00f6dl, A. Ruci\u0144ski, Random graphs with monochromatic triangles in every edge coloring, Random Structures and Algorithms 5 (1994), 253\u2013270.","journal-title":"Random Structures and Algorithms"},{"key":"3_CR110","doi-asserted-by":"publisher","first-page":"917","DOI":"10.2307\/2152833","volume":"8","author":"V. R\u00f6dl","year":"1995","unstructured":"V. R\u00f6dl, A. Ruci\u0144ski, Threshold functions for Ramsey properties, J. Amer. Math. Soc. 8 (1995), 917\u2013942.","journal-title":"J. Amer. Math. Soc."},{"key":"3_CR111","first-page":"939","volume":"18","author":"I. Z. Ruzsa","year":"1978","unstructured":"I. Z. Ruzsa, E. Szemer\u00e9di, Triple systems with no six points carrying three triangles, Combinatorics (Keszthely, 1976), 18 (1978), Vol. II., 939\u2013945, North-Holland, Amsterdam-New York.","journal-title":"Combinatorics (Keszthely, 1976)"},{"key":"3_CR112","unstructured":"G. N. S\u00e1rk\u00f6zy, Fast parallel algorithm for finding Hamiltonian cycles and trees in graphs."},{"key":"3_CR113","unstructured":"P. Seymour, Problem section, Combinatorics: Proceedings of the British Combinatorial Conference 1973 (T. P. McDonough and V. C. Mavron eds.), Cambridge University Press (1974), 201\u2013202."},{"key":"3_CR114","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01202793","volume":"13","author":"A. F. Sidorenko","year":"1993","unstructured":"A. F. Sidorenko, Boundedness of optimal matrices in extremal multigraph and digraph problems, Combinatorica 13 (1993), 109\u2013120.","journal-title":"Combinatorica"},{"key":"3_CR115","unstructured":"M. Simonovits, A method for solving extremal problems in graph theory, Theory of graphs, Proc. Coll. Tihany (1966) (P. Erd\u0151s and G. Katona eds.), Acad. Press, N.Y. (1968), 279\u2013319."},{"key":"3_CR116","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/0012-365X(74)90044-2","volume":"7","author":"M. Simonovits","year":"1974","unstructured":"M. Simonovits, Extremal graph problems with symmetrical extremal graphs, additional chromatic conditions, Discrete Mathematics 7 (1974), 349\u2013376.","journal-title":"Discrete Mathematics"},{"key":"3_CR117","author":"M. Simonovits","first-page":"161","year":"1985","unstructured":"M. Simonovits, Extremal graph theory, Selected Topics in Graph Theory (L. Beineke and R. Wilson eds.) Academic Press, London, New York, San Francisco (1985), 161\u2013200.","volume-title":"Selected Topics in Graph Theory"},{"key":"3_CR118","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/rsa.3240020102","volume":"2","author":"M. Simonovits","year":"1991","unstructured":"M. Simonovits, V. T. S\u00f3s, Szemer\u00e9di\u2019s partition and quasirandomness, Random Structures and Algorithms 2 (1991), 1\u201310.","journal-title":"Random Structures and Algorithms"},{"key":"3_CR119","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/BF01195005","volume":"17","author":"M. Simonovits","year":"1997","unstructured":"M. Simonovits and V. T. S\u00f3s, Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs, Combinatorica 17 (1997), 577\u2013596.","journal-title":"Combinatorica"},{"key":"3_CR120","unstructured":"M. Simonovits and V. T. S\u00f3s, Hereditarily extended properties, quasi-random graphs and induced subgraphs, to be published."},{"key":"3_CR121","unstructured":"M. Simonovits and V. T. S\u00f3s, Ramsey-Tur\u00e1n theory, Proc. Prague Meeting, Fifth Czech-Slovak International Symposia, Discrete Mathematics, to appear.","DOI":"10.1016\/S0012-365X(00)00214-4","doi-asserted-by":"crossref"},{"key":"3_CR122","unstructured":"V. T. S\u00f3s, On extremal problems in graph theory, Proc. Calgary International Conf. on Combinatorial Structures and their Application, Gordon and Breach, N. Y. (1969), 407\u2013410."},{"key":"3_CR123","unstructured":"V. T. S\u00f3s, Interaction of Graph Theory and Number Theory, in Proc. Conf. Paul Erd\u0151s and His Mathematics, Budapest, 1999. Springer Verlag, 2001."},{"key":"3_CR124","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BF01894569","volume":"20","author":"E. Szemer\u00e9di","year":"1969","unstructured":"E. Szemer\u00e9di, On sets of integers containing no four elements in arithmetic progression, Acta Math. Acad. Sci. Hung. 20 (1969), 89\u2013104.","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"3_CR125","first-page":"111","volume":"23","author":"E. Szemer\u00e9di","year":"1972","unstructured":"E. Szemer\u00e9di, On graphs containing no complete subgraphs with 4 vertices (in Hungarian), Matematikai Lapok 23 (1972), 111\u2013116.","journal-title":"Matematikai Lapok"},{"key":"3_CR126","doi-asserted-by":"crossref","first-page":"199","DOI":"10.4064\/aa-27-1-199-245","volume":"27","author":"E. Szemer\u00e9di","year":"1975","unstructured":"E. Szemer\u00e9di, On sets of integers containing no k elements in arithmetic progression, Acta Arithmetica 27 (1975), 199\u2013245.","journal-title":"Acta Arithmetica"},{"key":"3_CR127","unstructured":"E. Szemer\u00e9di, Regular partitions of graphs, Colloques Internationaux C.N.R.S. No 260-Probl\u00e8mes Combinatoires et Th\u00e9orie des Graphes, Orsay (1976), 399\u2013401."},{"key":"3_CR128","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF01903717","volume":"56","author":"E. Szemer\u00e9di","year":"1990","unstructured":"E. Szemer\u00e9di, Integer sets containing no arithmetic progressions, Acta Math. Acad. Sci. Hung. 56 (1990), 155\u2013158.","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"3_CR129","unstructured":"A. Thomason, Pseudo-random graphs, in Proc. of Random Graphs, Pozn\u00e1n (1985) (M. Karo\u0144ski ed.), Annals of Discr. Math. (North-Holland) 33 (1987), 307\u2013331. See also: Dense expanders and bipartite graphs, Discrete Mathematics 75 (1989), 381-386.","DOI":"10.1016\/0012-365X(89)90101-5","doi-asserted-by":"crossref"},{"key":"3_CR130","first-page":"436","volume":"48","author":"P. Tur\u00e1n","year":"1941","unstructured":"P\u00e1l Tur\u00e1n, On an extremal problem in graph theory (in Hungarian), Matematikai\u00e9s Fizikai Lapok 48 (1941), 436\u2013452.","journal-title":"Matematikai\u00e9s Fizikai Lapok"},{"key":"3_CR131","first-page":"212","volume":"15","author":"B. L. der Waerden Van","year":"1927","unstructured":"B. L. Van der Waerden, Beweis einer Baudetschen Vermutung, Nieuw Archief voor Wiskunde 15 (1927), 212\u2013216.","journal-title":"Nieuw Archief voor Wiskunde"},{"key":"3_CR132","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1002\/(SICI)1097-0118(199604)21:4<441::AID-JGT10>3.0.CO;2-I","volume":"21","author":"R. Yuster","year":"1996","unstructured":"R. Yuster, The number of edge colorings with no monochromatic triangle, J. Graph Theory 21 (1996), 441\u2013452.","journal-title":"J. Graph Theory"}],"container-title":["Theoretical Aspects of Computer Science","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45878-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,22]],"date-time":"2020-04-22T20:33:38Z","timestamp":1587587618000},"score":1.0,"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433286","9783540458784"],"references-count":132,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-45878-6_3","relation":{"cites":[]},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}]}}