Papers to download

There are overlaps in the "classification below!"

Extremal Graph Theory and closely related fields

• Luczak, Tomasz; Simonovits, Miklós: On the minimum degree forcing F-free graphs to be (nearly) bipartite. Discrete Math. 308 (2008), no. 17, 3998--4002. [pdf]
• Griggs, Jerrold R.; Simonovits, Miklós and Thomas, George Rubin: Extremal graphs with bounded densities of small subgraphs. J. Graph Theory 29 (1998), no. 3, 185--207. [pdf]
• Babai, László; Simonovits, Miklós; Spencer, Joel: Extremal subgraphs of random graphs. J. Graph Theory 14 (1990), no. 5, 599--622. [pdf]
• Simonovits, Miklós: How to solve a Turán type extremal graph problem? (linear decomposition). Contemporary trends in discrete mathematics (Stirin Castle, 1997), 283--305, DIMACS Ser. Discrete Math. Theoret. Comput. Sci., 49, Amer. Math. Soc., Providence, RI, 1999.[pdf]
• Györi, Ervin; Pach, János; Simonovits, Miklós: On the maximal number of certain subgraphs in $K_r$-free graphs. Graphs Combin. 7 (1991), no. 1, 31--37. [pdf]
• Simonovits, M.: Extremal graph problems and graph products. Studies in pure mathematics, 669--680, Birkhäuser, Basel, 1983. [pdf]
• Erdös, P.; Simonovits, M.: Compactness results in extremal graph theory. Combinatorica 2 (1982), no. 3, 275--288. [pdf]
• Bondy, J. A. and Simonovits, M.: Longest cycles in 3-connected 3-regular graphs. Canad. J. Math. 32 (1980), no. 4, 987--992. [pdf]
• Bollobás, B.; Erdös, P.; Simonovits, M. and 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. [pdf]
• Bollobás, B.; Erdös, P. and Simonovits, M.: On the structure of edge graphs. II. J. London Math. Soc. (2) 12 (1975/76), no. 2, 219--224. [pdf]
• Simonovits, Miklós: The extremal graph problem of the icosahedron. J. Combinatorial Theory Ser. B 17 (1974). 69--79. [pdf]
• Simonovits, M.: Extermal graph problems with symmetrical extremal graphs. Additional chromatic conditions. Discrete Math. 7 (1974), 349--376. [pdf]
• Bondy, J. A. and Simonovits, M.: Cycles of even length in graphs. J. Combinatorial Theory Ser. B 16 (1974), 97--105. [pdf]
• Erdös, P. and Simonovits, M.: On a valence problem~in graph theory, Discrete Mathematics 5 (1973), 323-334. [pdf]
• 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. [pdf]
• Simonovits, Miklós: Extremal graph problems, Proc. Calgary International Conference on Combinatorial Structures and their Application (1969) 399-401. [pdf]
• Erdös, P. and 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. [pdf]
• Erdös, P.; Simonovits, M.: A limit theorem in graph theory. Studia Sci. Math. Hungar 1 1966 51--57. [pdf]
• Katona, Gyula (OH), Nemetz, Tibor, and Simonovits, Miklós: On a graph-problem of Turán (in a Hungarian), Mat. Lapok 15 (1964) 228-238. [pdf]

Embedding trees

• J. Hladky, J. Komlós, D. Piguet, M. Simonovits, M. Stein, E. Szemerédi: The approximate Loebl-Komlós-Sós Conjecture I: The sparse decomposition SIAM Journal on Discrete Mathematics, 31(2), pages 945--982. [pdf]
• J. Hladky, J. Komlós, D. Piguet, M. Simonovits, M. Stein, E. Szemerédi: The approximate Loebl-Komlós-Sós Conjecture II: The rough structure of LKS graphs SIAM Journal on Discrete Mathematics, 31(2), pages 983--1016. [pdf]
• J. Hladky, J. Komlós, D. Piguet, M. Simonovits, M. Stein, E. Szemerédi: The approximate Loebl-Komlós-Sós Conjecture III: The finer structure of LKS graphs SIAM Journal on Discrete Mathematics, 31(2), pages 1017-1071. [pdf]
• J. Hladky, J. Komlós, D. Piguet, M. Simonovits, M. Stein, E. Szemerédi: The approximate Loebl-Komlós-Sós Conjecture IV: Embedding techniques and the proof of the main result SIAM Journal on Discrete Mathematics, 31(2), pages 1072-1148. [pdf]
• J. Hladky, D. Piguet, M. Simonovits, M. Stein, E. Szemerédi: The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs Electronic Research Announcements in Mathematical Sciences 22, p.1-11; [pdf]

Digraps, multigraphs

• Brown, W. G. and Simonovits, M.: Extremal multigraph and digraph problems. Paul Erdös and his mathematics, II (Budapest, 1999), 157--203, Bolyai Soc. Math. Stud., 11, János Bolyai Math. Soc., Budapest, 2002. [PS] [pdf]
[Vigyazat, van egy rossz pdf is, lecserelendo!!!]
• Brown, W. G.; Erdös, P. and Simonovits, M.: Algorithmic solution of extremal digraph problems. Trans. Amer. Math. Soc. 292 (1985), no. 2, 421--449. [pdf]
• 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. [pdf]
• William G. Brown, Paul Erdös and Miklós Simonovits: Inverse Extremal Graph Problems, Finite and Infinite Sets, Eger, 1981, Coll. Math. Soc. Janos Bolyai & North Holland [pdf]
• William G. Brown, Paul Erdös and Miklós Simonovits: On Multigraph Extremal Problems, Internat. CNRS, Univ. Orsay, Orsay, 1976), pp. 63--66, Colloq. Internat. CNRS, 260, CNRS, Paris, 1978. [pdf]
• Brown, W. G.; Erdös, P.; Simonovits, M.: Extremal problems for directed graphs. J. Combinatorial Theory Ser. B 15 (1973), 77--93. [pdf]

  Anti-Ramsey (?) structures

  ---

  Vera Sós, Erdös and myself called these colouring originally "totally multicoloured subgraphs", however, Erdös and Tuza renamed it later "rainbow" and this name became now more popular. Yet, the Anti-Ramsey came -- in a different setting -- perhaps from Richard Rado, and then our papers (see below) started this area for graphs.

  ---

• 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. [pdf]
• Simonovits, Miklós and Sós, Vera T.: On restricted colourings of $K_n$. Combinatorica 4 (1984), no. 1, 101--110. [pdf]

  Quasi-random structures

• Miklós Simonovits and Vera T. Sós:Szemerédi's partition and quasirandomness. Random Structures Algorithms 2 (1991), no. 1, 1--10. [pdf]
• Miklós Simonovits and Vera T. Sós:Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs. Combinatorica 17 (1997), no. 4, 577--596. [PS] [pdf]
• Miklós Simonovits and Vera T. Sós, Hereditarily extended properties, quasi-random graphs and induced subgraphs. Combinatorics, Probability and Computing (Oberwolfach, 2001). Combin. Probab. Comput. 12 (2003), no. 3, 319--344. [PS] [pdf]

  Hypergraphs

• András Gyárfás, Ervin Gyori and Miklós Simonovits: On $3$-uniform hypergraphs without linear cycles, [pdf]
• Füredi, Zoltán and Simonovits, Miklós: Triple systems not containing a Fano configuration. Combin. Probab. Comput. 14 (2005), no. 4, 467--484. [pdf]
• Füredi, Zoltán; Pikhurko, Oleg; Simonovits, Miklós 4-books of three pages. J. Combin. Theory Ser. A 113 (2006), no. 5, 882--891. [pdf]
• Füredi, Zoltán; Pikhurko, Oleg and Simonovits, Miklós: The Turán density of the hypergraph {abc,ade,bde,cde}. Electron. J. Combin. 10 (2003), Research Paper 18, 7 pp. (electronic). [pdf]
• Füredi, Zoltán; Pikhurko, Oleg and Simonovits, Miklós: On triple systems with independent neighbourhoods. Combin. Probab. Comput. 14 (2005), no. 5-6, 795--813.
• Claude Berge, Miklós Simonovits: 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. [pdf]
• Claude Berge, and Simonovits, Miklós: Colouring numbers of the direct product of two hypergraphs. Hypergraph seminar Springer LNM 411 and also Proc Indian National Science Academy, vol 41 Part A (3) May 1975, pp 264--274. [pdf]
(These are two identical papers of different outlook Claude Berge submitted the original LNM version to the Indian Academy...)
• Miklós Simonovits: 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. [pdf]
• Simonovits, M.: On colour-critical graphs. Studia Sci. Math. Hungar. 7 (1972), 67--81. [pdf]

Supersaturated graphs and hypergraphs

• Erdös, Paul; Simonovits, Miklós Supersaturated graphs and hypergraphs. Combinatorica 3 (1983), no. 2, 181--192. [pdf]
• P. Erdös and M. Simonovits: Cube supersaturated graphs and related problems, Progress in Graph Theory, (Waterloo, Ont., 1982), 203--218, Academic Press, Toronto, ON, 1984. (eds Bondy and Murty) [pdf from Erdös' homepage]
• Simonovits, Miklós: Extremal graph problems, degenerate extremal problems, and supersaturated graphs Progress in Graph Theory, (eds Bondy and Murty, Waterloo, Ont., 1982), 419--437, Academic Press, Toronto, ON, 1984. [pdf]
• László Lovász, and Miklós Simonovits: On the number of complete subgraphs of a graph. II. Studies in pure mathematics, 459495, Birkhuser, Basel, 1983. (From LL's homepage) [pdf]



---




Ramsey-related papers

• Luczak, Tomasz; , Simonovits, Miklós; Skokan, Jozef: On the multi-colored Ramsey numbers of cycles. J. Graph Theory 69 (2012), no. 2, 169--175. pdf
• Penny Haxell, Tomasz Luczak, Y. Peng, Vojta Rödl, Andrej Rucinski, Miklós Simonovits, Jozef Skokan: [M] The Ramsey number for hypergraph cycles I J. Combin. Theory Ser. A 113 (2006), no. 1, 67--83. pdf
• Miklós Simonovits and Vera T. Sós: A hierarchy of randomness for graphs. Discrete Math. 303 (2005), no. 1-3, 209--233. [pdf]
• Paul Balister, Schelp, R. H. and Simonovits, M.: A note on Ramsey size-linear graphs. J. Graph Theory 39 (2002), no. 1, 1--5. pdf
• Simonovits, Miklós and Sós, Vera T.: Different levels of randomness in random Ramsey theorems. Electronic notes in discrete mathematics. Vol. 15, 191--194 (electronic), Electron. Notes Discrete Math., 15, Elsevier, Amsterdam, 2003. [pdf]
• Kohayakawa, Yoshiharu; Simonovits, Miklós and Skokan, Jozef: The 3-colored Ramsey number of odd cycles. Proceedings of GRACO2005, 397--402 (electronic), Electron. Notes Discrete Math., 19, Elsevier, Amsterdam, 2005. [pdf]
• Simonovits, Miklós and Sós, Vera T.: Paul Erdös: the man and the mathematician (1913--1996). (Hungarian) Mat. Lapok (N.S.) 7 (1997), no. 3-4, 4--32 (2003).
• József Balogh, Ping Hu, Miklós Simonovits: Phase transitions in the Ramsey-Turán theory, arXiv:1408.5296 [pdf]
• Erdös, P.; Hajnal, A.; Simonovits, M.; Sós, V. T. and Szemerédi, E.: Turán-Ramsey theorems and $K_p$-independence numbers, Combinatorics, geometry and probability (Cambridge, 1993), 253--281, Cambridge Univ. Press, Cambridge, 1997.
• Erdös, P.; Hajnal, A.; Simonovits, M.; Sós, V. T. and Szemerédi, E.: Turán-Ramsey theorems and $K_p$-independence numbers. Combin. Probab. Comput. 3 (1994), no. 3, 297--325.
• Faudree, Ralph J. and Simonovits, Miklós: Ramsey problems and their connection to Turán-type extremal problems. J. Graph Theory 16 (1992), no. 1, 25--50. [pdf missing]
• Galluccio, Anna; Simonovits, Miklós and 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. [pdf]

  ---

  Typical Structure (Erdös-Kleitman-Rothschild type results)

• Balogh, József Bollobás, Béla and Simonovits, Miklós: The fine structure of octahedron-free graphs. J. Combin. Theory Ser. B 101 (2011), no. 2, 67--84. [pdf]
• Balogh, József; Bollobás, Béla and Simonovits, Miklós The typical structure of graphs without given excluded subgraphs. Random Structures Algorithms 34 (2009), no. 3, 305--318. [pdf]
• Balogh, József; Bollobás, Béla and Simonovits, Miklós: The number of graphs without forbidden subgraphs. J. Combin. Theory Ser. B 91 (2004), no. 1, 1--24. Random Structures Algorithms 34 (2009), no. 3, 305--318. [pdf]

Structural Intersection Theorems

• Graham, R. L.; Simonovits, M. and Sós, V. T.: A note on the intersection properties of subsets of integers. J. Combin. Theory Ser. A 28 (1980), no. 1, 106--110. [pdf]
• Simonovits, Miklós and Sós, Vera T.: Intersection properties of subsets of integers. European J. Combin. 2 (1981), no. 4, 363--372. [pdf]
• Simonovits, Miklós and Sós, Vera T.: Intersection theorems on structures. Combinatorial mathematics, optimal designs and their applications (Proc. Sympos. Combin. Math. and Optimal Design, Colorado State Univ., Fort Collins, Colo., 1978). Ann. Discrete Math. 6 (1980), 301--313. [pdf]
• Simonovits, Miklós and Sós, Vera T.: Intersection theorems for graphs. Problemes combinatoires et théorie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976), pp. 389--391, Colloq. Internat. CNRS, 260, CNRS, Paris, 1978. [pdf]

Estimating the volume

See also László Lovász, homepage For newest results look for Santosh Vempala's homepage


---



• Lovász, László and Simonovits, Miklós: The mixing rate of Markov chains, an isoperimetric inequality, and computing the volume. 31st Annual Symposium on Foundations of Computer Science, Vol. I, II (St. Louis, MO, 1990), 346--354, IEEE Comput. Soc. Press, Los Alamitos, CA, 1990. [pdf]
• L. Lovász and M. Simonovits: Random walks in a convex body and an improved volume algorithm, {\it Random Structures and Algorithms} {\bf 4}(4), (1993) 359--412. [pdf]
• Ravi Kannan, Laszlo Lovász, and Miklós Simonovits: Random walks and an $O^*(n^5)$ volume algorithm for convex bodies, Random Structures and Algorithms 11(1) (1997) 1-50. [pdf]
• Kannan, R.; Lovász, L. and Simonovits, M.: Isoperimetric problems for convex bodies and a localization lemma. Discrete Comput. Geom. 13 (1995), no. 3-4, 541--559. [pdf]
• Brieden, Andreas; Gritzmann, Peter; Kannan, Ravindran; Klee, Victor; Lovász, László and Simonovits, Miklós: Deterministic and randomized polynomial-time approximation of radii.
• A. Brieden, P. Gritzmann, R. Kannan, V. Klee, L. Lovasz and M. Simonovits. Approximation of radii and norm-maxima: Randomization doesn't help. Proc. 39th Sympos. FOCS, IEEE (1998), 244--251. [pdf]
• Brieden, Andreas; Gritzmann, Peter; Kannan, Ravindran; Klee, Victor; Lovász, László and Simonovits, Miklós: Deterministic and randomized polynomial-time approximation of radii. Mathematika 48 (2001), no. 1-2, 63--105 (2003). [pdf]
• Miklós Simonovits, How to compute the voume in high dimension? SMP, 2003 (Copenhagen). Math. Program. 97 (2003), no. 1-2, Ser. B, 337-374. [pdf]
  

  ---

  
  

  On Paul Erdös (in English)

• Simonovits, Miklós: Paul Erdös in the 21st century. Eur. Math. Soc. Newsl. No. 91 (2014), 23--29. 01A70
• Miklós Simonovits: Some of my Favorite Erdős Theorems and related results, theories in Paul Erdős and his mathematics, II. Springer 2002. [PS] [pdf]
• Miklós Simonovits: My Favorite Erdős Theorems: Long version of the previous paper (Only a preliminary version) [PS] [pdf]
• Simonovits, Miklós and Sós, Vera T.: Foreword. Paul Erdös: the man and the mathematician (1913--1996). Recent trends in combinatorics (Mátraháza, 1995), ix--xx, Cambridge Univ. Press, Cambridge, 2001. [PS] [pdf]
• Simonovits, Miklós: Paul Erdös' influence on extremal graph theory. The mathematics of Paul Erdös, II, 148--192, Algorithms Combin., 14, Springer, Berlin, 1997. [pdf]

  On Paul Erdös, (in Hungarian)

• Simonovits Miklós: On Paul Erdös 80th birthday Polygon, Szeged 1993 (III/1) [pdf]
• Simonovits Miklós: Erdös Pál a 21. században, Magyar Tud. 2013 november 1358--1368, [pdf]



---




Selected surveys

• M. Simonovits: Extremal Graph Theory Selected topics in graph theory, 2, 161--200, Academic Press, London, 1983. (eds Beineke and Wilson). [pdf] This huge file will be replaced by a much more concise "annotated" one, which also contains many extra remarks, references and figures.
• Komlós, J. and Simonovits, M.: Szemerédi's regularity lemma and its applications in graph theory. Combinatorics, Paul Erdös is eighty, Vol. 2 (Keszthely, 1993), 295--352, Bolyai Soc. Math. Stud., 2, János Bolyai Math. Soc., Budapest, 1996. [pdf]
• Komlós, János; Shokoufandeh, Ali; Simonovits, Miklós and Szemerédi, Endre: The regularity lemma and its applications in graph theory. Theoretical aspects of computer science (Tehran, 2000), 84--112, Lecture Notes in Comput. Sci., 2292, Springer, Berlin, 2002. [pdf]
• Füredi, Zoltán and Simonovits, Miklós: The history of degenerate (bipartite extremal graph problems). Erdös centennial, 169--264, Bolyai Soc. Math. Stud., 25, János Bolyai Math. Soc., Budapest, 2013. [pdf]
• Simonovits, Miklós Paul Turán's influence in combinatorics. Number theory, analysis, and combinatorics, 309--392, De Gruyter Proc. Math., De Gruyter, Berlin, 2014. [pdf]
• Simonovits, M.: On Paul Turán's influence on graph theory. J. Graph Theory 1 (1977), no. 2, 102--116. [pdf]
• M. Simonovits and Vera T. Sós, Ramsey-Turán theory. Combinatorics, graph theory, algorithms and applications. Discrete Math. 229 (2001), no. 1-3, 293--340. [PS] [pdf]
• Simonovits, M., Szemerédi, E: On Paul Turán's influence on graph theory. J. Graph Theory 1 (1977), no. 2, 102--116. [pdf]



---




Elekes type geometry

• Elekes, György, Simonovits, Miklós, and Szabó Endre: A combinatorial distinction between unit circles and straight lines: how many coincidences can they have? Combin. Probab. Comput. 18 (2009), no. 5, 691--705. [pdf]
• Simonovits, Miklós and Szabó, Endre: Gyuri Elekes and the incidences. Ann. Univ. Sci. Budapest. Eötvös Sect. Math. 52 (2009), 53--73 (2010). [pdf]
• Simonovits, Miklós Personal reminiscences, Gyuri Elekes. Ann. Univ. Sci. Budapest. Eötvös Sect. Math. 52 (2009), 25--30 (2010).[pdf]

Some further papers

• Walter Deuber, Miklós Simonovits and Vera T. Sós: A note on paradoxical metric spaces. Studia Sci. Math. Hungar. 30 (1995), no. 1-2, 17--23. [PDF, Annotated]
• Dietmann, Rainer; Elsholtz, Christian; Gyarmati, Katalin and Simonovits, Miklós Shifted products that are coprime pure powers. J. Combin. Theory Ser. A 111 (2005), no. 1, 24--36. [pdf]
• Duffus, Dwight, Rival, Ivan, and Simonovits, M.: Spanning retracts of a partially ordered set. Discrete Math. 32 (1980), no. 1, 1--7. [pdf]

  ---

  Papers to be organized, posted / duplicates
• Erdös, P.; Hajnal, A.; Simonovits, M.; Sós, V. T. and Szemerédi, E.: Turán-Ramsey theorems and simple asymptotically extremal structures. Combinatorica 13 (1993), no. 1, 31--56.
• Erdös, P.; Simonovits, M.; Sós, Vera T. and Rao, S. B.: [M] On totally supercompact graphs. Combinatorial mathematics and applications (Calcutta, 1988). Sankhyā Ser. A 54 (1992), Special Issue, 155--167. 05C75 (05C35)
• Erdös, P.; Györi, E. and 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, 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, 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.
• Schelp, R. H.; Simonovits, M.; Sós, V. T.: Intersection theorems for $t$-valued functions. European J. Combin. 9 (1988), no. 6, 531--536.
• Faudree, R. J.; Simonovits, M.: On a class of degenerate extremal graph problems. Combinatorica 3 (1983), no. 1, 83--93.
• Lovász, L.; Sárközy, A.; Simonovits, M.: On additive arithmetic functions satisfying a linear recursion. Ann. Univ. Sci. Budapest. Eötvös Sect. Math. 24 (1981), 205--215.
• Erdös, P.; Simonovits, M.: On the chromatic number of geometric graphs. Ars Combin. 9 (1980), 229--246.
• Simonovits, M.; Sós, V. T. Intersection theorems for graphs. II. Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976), Vol. II, pp. 1017--1030, Colloq. Math. Soc. János Bolyai, 18, North-Holland, Amsterdam-New York, 1978.
• 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.
• Erdös, Paul; Simonovits, Miklós: On a problem of M. D. Hirschhorn (Amer. Math. Monthly 80 (1973), no. 6, part 1, 675--677). Amer. Math. Monthly 83 (1975), no. 1, 23--26.
• 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.: An extremal graph problem. Acta Math. Acad. Sci. Hungar. 22 (1971/72), 275--282.
• 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
• 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.