Extremal problems

• Balister, P. N.; Schelp, R. H.; Simonovits, M.: A note on Ramsey size-linear graphs. J. Graph Theory 39 (2002), no. 1, 1--5.
• Galluccio, Anna; Simonovits, Miklós; Simonyi, Gábor On the structure of co-critical graphs. Graph theory, combinatorics, and algorithms, Vol. 1, 2 (Kalamazoo, MI, 1992), 1053--1071, Wiley-Intersci. Publ., Wiley, New York, 1995.
• Simonovits, Miklós: How to solve a Turán type extremal graph problem? (linear decomposition). Contemporary trends in discrete mathematics (Stirín Castle, 1997), 283--305, DIMACS Ser. Discrete Math. Theoret. Comput. Sci., 49, Amer. Math. Soc., Providence, RI, 1999.
• Griggs, Jerrold R.; Simonovits, Miklós; Thomas, George Rubin Extremal graphs with bounded densities of small subgraphs. J. Graph Theory 29 (1998), no. 3, 185--207.
• Faudree, R. J.; Schelp, R. H.; Simonovits, Miklós: On some Ramsey type problems connected with paths, cycles and trees. Twelfth British Combinatorial Conference (Norwich, 1989). Ars Combin. 29 (1990), A, 97--106.
• Erdös, P.; Hajnal, A.; Simonovits, M.; Sós, V. T.; Szemerédi, E. Turán-Ramsey theorems and $K\sb p$-independence numbers. Combin. Probab. Comput. 3 (1994), no. 3, 297--325.
• Erdös, P.; Simonovits, M.; Sós, Vera T.; Rao, S. B. On totally supercompact graphs. Combinatorial mathematics and applications (Calcutta, 1988). Sankhy\=a Ser. A 54 (1992), Special Issue, 155--167.
• Erdös, P.; Hajnal, A.; Simonovits, M.; Sós, V. T.; Szemerédi, E. Turán-Ramsey theorems and simple asymptotically extremal structures. Combinatorica 13 (1993), no. 1, 31--56.
• Erdös, P.; Györi, E.; Simonovits, M. How many edges should be deleted to make a triangle-free graph bipartite? Sets, graphs and numbers (Budapest, 1991), 239--263, Colloq. Math. Soc. János Bolyai, 60, North-Holland, Amsterdam, 1992.
• Faudree, Ralph J.; Simonovits, Miklós: Ramsey problems and their connection to Turán-type extremal problems. J. Graph Theory 16 (1992), no. 1, 25--50.
• Erdös, Paul; Faudree, R. J.; Schelp, R. H.; Simonovits, M. An extremal result for paths. Graph theory and its applications: East and West (Jinan, 1986), 155--162, Ann. New York Acad. Sci., 576, New York Acad. Sci., New York, 1989.
• Györi, Ervin; Pach, János; Simonovits, Miklós: On the maximal number of certain subgraphs in $K\sb r$-free graphs. Graphs Combin. 7 (1991), no. 1, 31--37.
• Babai, László; Simonovits, Miklós; Spencer, Joel Extremal subgraphs of random graphs. J. Graph Theory 14 (1990), no. 5, 599--622.
• Schelp, R. H.; Simonovits, M.; Sós, V. T. Intersection theorems for $t$-valued functions. European J. Combin. 9 (1988), no. 6, 531--536.
• Simonovits, M. Extremal graph problems and graph products. Studies in pure mathematics, 669--680, Birkhäuser, Basel, 1983.
• 29] Brown, W. G.; Erdös, P.; Simonovits, M. Inverse extremal digraph problems. Finite and infinite sets, Vol. I, II (Eger, 1981), 119--156, Colloq. Math. Soc. János Bolyai, 37, North-Holland, Amsterdam, 1984.
• Lovász, L.; Simonovits, M. On the number of complete subgraphs of a graph. II. Studies in pure mathematics, 459--495, Birkhäuser, Basel, 1983.
• Brown, W. G.; Erdös, P.; Simonovits, M. Algorithmic solution of extremal digraph problems. Trans. Amer. Math. Soc. 292 (1985), no. 2, 421--449.
• Simonovits, Miklós: Extremal graph problems, degenerate extremal problems, and supersaturated graphs. Progress in graph theory (Waterloo, Ont., 1982), 419--437, Academic Press, Toronto, ON, 1984.
• Simonovits, M. Extremal graph theory. Selected topics in graph theory, 2, 161--200, Academic Press, London, 1983.
• Erdös, P.; Simonovits, M. Cube-supersaturated graphs and related problems. Progress in graph theory (Waterloo, Ont., 1982), 203--218, Academic Press, Toronto, ON, 1984.
• Simonovits, Miklós; Sós, Vera T.: On restricted colourings of $K\sb n$. Combinatorica 4 (1984), no. 1, 101--110.
• Erdös, Paul; Simonovits, Miklós: Supersaturated graphs and hypergraphs. Combinatorica 3 (1983), no. 2, 181--192.
• Faudree, R. J.; Simonovits, M. On a class of degenerate extremal graph problems. Combinatorica 3 (1983), no. 1, 83--93.
• Brown, W. G.; Simonovits, M. Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures. Discrete Math. 48 (1984), no. 2-3, 147--162.
• Erdös, P.; Simonovits, M. Compactness results in extremal graph theory. Combinatorica 2 (1982), no. 3, 275--288.
• Erdös, P.; Simonovits, M. On the chromatic number of geometric graphs. Ars Combin. 9 (1980), 229--246.
• Bondy, J. A.; Simonovits, M. Longest cycles in $3$-connected $3$-regular graphs. Canad. J. Math. 32 (1980), no. 4, 987--992.
• Bollobás, B.; Erdös, P.; Simonovits, M.; Szemerédi, E. Extremal graphs without large forbidden subgraphs. Advances in graph theory (Cambridge Combinatorial Conf., Trinity Coll., Cambridge, 1977). Ann. Discrete Math. 3 (1978), 29--41.
• Lovász, L.; Simonovits, Miklós: On the number of complete subgraphs of a graph. Proceedings of the Fifth British Combinatorial Conference (Univ. Aberdeen, Aberdeen, 1975), pp. 431--441. Congressus Numerantium, No. XV, Utilitas Math., Winnipeg, Man., 1976.
• Simonovits, M.: On graphs not containing large saturated planar graphs. Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erdös on his 60th birthday), Vol. III, pp. 1365--1386. Colloq. Math. Soc. Janos Bolyai, Vol. 10, North-Holland, Amsterdam, 1975.
• Erdös, P.; Simonovits, M.; Sós, V. T. Anti-Ramsey theorems. Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erdös on his 60th birthday), Vol. II, pp. 633--643. Colloq. Math. Soc. Janos Bolyai, Vol. 10, North-Holland, Amsterdam, 1975. (Reviewer: Rudolf Halin) 05C15
• Simonovits, Miklós: The extremal graph problem of the icosahedron. J. Combinatorial Theory Ser. B 17 (1974). 69--79.
• Berge, C.; Simonovits, M. The coloring numbers of the direct product of two hypergraphs. Hypergraph Seminar (Proc. First Working Sem., Ohio State Univ., Columbus, Ohio, 1972; dedicated to Arnold Ross), pp. 21--33. Lecture Notes in Math., Vol. 411, Springer, Berlin, 1974.
• Simonovits, M. Note on a hypergraph extremal problem. Hypergraph Seminar (Proc. First Working Sem., Ohio State Univ., Columbus, Ohio, 1972; dedicated to Arnold Ross), pp. 147--151. Lecture Notes in Math., Vol. 411, Springer, Berlin, 1974.
• Unsolved problems. Hypergraph Seminar (Proc. First Working Sem., Ohio State Univ., Columbus, Ohio, 1972; dedicated to Arnold Ross), pp. 278--287. Lecture Notes in Math., Vol. 411, Springer, Berlin, 1974.
• Erdös, P.; Simonovits, M. On a valence problem in extremal graph theory. Discrete Math. 5 (1973), 323--334.
• Bondy, J. A.; Simonovits, M. Cycles of even length in graphs. J. Combinatorial Theory Ser. B 16 (1974), 97--105.
• Simonovits, M. Extermal graph problems with symmetrical extremal graphs. Additional chromatic conditions. Discrete Math. 7 (1974), 349--376.
• Brown, W. G.; Erdös, P.; Simonovits, M. Extremal problems for directed graphs. J. Combinatorial Theory Ser. B 15 (1973), 77--93.
• Simonovits, M. On colour-critical graphs. Studia Sci. Math. Hungar. 7 (1972), 67--81.
• Simonovits, M. Extremal graph problems with conditions. Combinatorial theory and its applications, III (Proc. Colloq., Balatonfüred, 1969), pp. 999--1012. North-Holland, Amsterdam, 1970
• Erdös, P.; Simonovits, M. Some extremal problems in graph theory. Combinatorial theory and its applications, I (Proc. Colloq., Balatonfüred, 1969), pp. 377--390. North-Holland, Amsterdam, 1970.
• Erdös, P.; Simonovits, M. An extremal graph problem. Acta Math. Acad. Sci. Hungar. 22 (1971/72), 275--282.
• Simonovits, M. A method for solving extremal problems in graph theory, stability problems. 1968 Theory of Graphs (Proc. Colloq., Tihany, 1966) pp. 279--319 Academic Press, New York
• Berge, C.; Simonovits, M. Colouring numbers of the direct product of two hypergraphs. Proc. Indian Nat. Sci. Acad. Part A 41 (1975), no. 3, 264--274.
• Bollobás, B.; Erdös, P.; Simonovits, M. On the structure of edge graphs. II. J. London Math. Soc. (2) 12 (1975/76), no. 2, 219--224.
• Simonovits, M. A new proof and generalizations of a theorem of Erdös and Pósa on graphs without $k+1$ independent circuits. Acta Math. Acad. Sci. Hungar. 18 1967 191--206.
• Erdös, P.; Simonovits, M. A limit theorem in graph theory. Studia Sci. Math. Hungar 1 1966 51--57.
• Katona, Gyula; Nemetz, Tibor; Simonovits, Miklós: On a problem of Turán in the theory of graphs. (Hungarian) Mat. Lapok 15 1964 228--238.