Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMiklós Simonovits
Person information
- affiliation: Alfréd Rényi Institute of Mathematics, Budapest, Hungary
- award (2014): Széchenyi Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2017
[j46]Jan Hladký
, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi:
The Approximate Loebl-Komlós-Sós Conjecture I: The Sparse Decomposition. SIAM J. Discret. Math. 31(2): 945-982 (2017)- [j45]Jan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi:
The Approximate Loebl-Komlós-Sós Conjecture II: The Rough Structure of LKS Graphs. SIAM J. Discret. Math. 31(2): 983-1016 (2017) - [j44]Jan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi:
The Approximate Loebl-Komlós-Sós Conjecture III: The Finer Structure of LKS Graphs. SIAM J. Discret. Math. 31(2): 1017-1071 (2017) - [j43]Jan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi:
The Approximate Loebl-Komlós-Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result. SIAM J. Discret. Math. 31(2): 1072-1148 (2017) - 2015
- [j42]József Balogh, Ping Hu, Miklós Simonovits:
Phase transitions in Ramsey-Turán theory. J. Comb. Theory B 114: 148-169 (2015) - 2012
- [j41]Tomasz Luczak, Miklós Simonovits, Jozef Skokan:
On the multi-colored Ramsey numbers of cycles. J. Graph Theory 69(2): 169-175 (2012) - 2011
- [j40]József Balogh, Béla Bollobás, Miklós Simonovits:
The fine structure of octahedron-free graphs. J. Comb. Theory B 101(2): 67-84 (2011) - 2009
- [j39]György Elekes, Miklós Simonovits, Endre Szabó:
A Combinatorial Distinction Between Unit Circles and Straight Lines: How Many Coincidences Can they Have? Comb. Probab. Comput. 18(5): 691-705 (2009) - [j38]József Balogh, Béla Bollobás, Miklós Simonovits:
The typical structure of graphs without given excluded subgraphs. Random Struct. Algorithms 34(3): 305-318 (2009) - 2008
- [j37]Tomasz Luczak, Miklós Simonovits:
On the minimum degree forcing F-free graphs to be (nearly) bipartite. Discret. Math. 308(17): 3998-4002 (2008) - 2006
- [j36]Penny E. Haxell, Tomasz Luczak, Yuejian Peng, Vojtech Rödl, Andrzej Rucinski, Miklós Simonovits, Jozef Skokan:
The Ramsey number for hypergraph cycles I. J. Comb. Theory A 113(1): 67-83 (2006) - [j35]Zoltán Füredi, Oleg Pikhurko, Miklós Simonovits:
4-Books of three pages. J. Comb. Theory A 113(5): 882-891 (2006) - 2005
- [j34]Zoltán Füredi, Miklós Simonovits:
Triple Systems Not Containing a Fano Configuration. Comb. Probab. Comput. 14(4): 467-484 (2005) - [j33]Miklós Simonovits, Vera T. Sós:
A hierarchy of randomness for graphs. Discret. Math. 303(1-3): 209-233 (2005) - [j32]Yoshiharu Kohayakawa, Miklós Simonovits, Jozef Skokan:
The 3-colored Ramsey number of odd cycles. Electron. Notes Discret. Math. 19: 397-402 (2005) - [j31]Rainer Dietmann, Christian Elsholtz, Katalin Gyarmati, Miklós Simonovits:
Shifted products that are coprime pure powers. J. Comb. Theory A 111(1): 24-36 (2005) - 2004
- [j30]József Balogh, Béla Bollobás, Miklós Simonovits:
The number of graphs without forbidden subgraphs. J. Comb. Theory B 91(1): 1-24 (2004) - 2003
- [j29]Zoltán Füredi, Oleg Pikhurko, Miklós Simonovits:
The Tura'n Density of the Hypergraph {abc, ade, bde, cde}. Electron. J. Comb. 10 (2003) - [j28]Miklós Simonovits, Vera T. Sós:
Hereditary Extended Properties, Quasi-Random Graphs And Induced Subgraphs. Comb. Probab. Comput. 12(3): 319-344 (2003) - [j27]Miklós Simonovits, Vera T. Sós:
Different levels of randomness in Random Ramsey theorems. Electron. Notes Discret. Math. 15: 189-192 (2003) - [j26]Miklós Simonovits:
How to compute the volume in high dimension? Math. Program. 97(1-2): 337-374 (2003) - 2002
- [j25]Paul N. Balister, Richard H. Schelp, Miklós Simonovits:
A note on Ramsey size-linear graphs. J. Graph Theory 39(1): 1-5 (2002) - 2001
- [j24]Miklós Simonovits, Vera T. Sós:
Ramsey-Turán theory. Discret. Math. 229(1-3): 293-340 (2001) - 1998
- [j23]Jerrold R. Griggs, Miklós Simonovits, George Rubin Thomas:
Extremal graphs with bounded densities of small subgraphs. J. Graph Theory 29(3): 185-207 (1998) - 1997
- [j22]Miklós Simonovits, Vera T. Sós:
Hereditarily Extended Properties, Quasi-Random Graphs and not Necessarily Induced Subgraphs. Comb. 17(4): 577-596 (1997) - [j21]Ravi Kannan, László Lovász, Miklós Simonovits:
Random walks and an O*(n5) volume algorithm for convex bodies. Random Struct. Algorithms 11(1): 1-50 (1997) - 1995
- [j20]Ravi Kannan, László Lovász, Miklós Simonovits:
Isoperimetric Problems for Convex Bodies and a Localization Lemama. Discret. Comput. Geom. 13: 541-559 (1995) - 1994
- [j19]Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi:
Turán-Ramsey Theorems and Kp-Independence Numbers. Comb. Probab. Comput. 3: 297-325 (1994) - 1993
- [j18]Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi:
Turán-Ramsey theorems and simple asymptotically extremal structures. Comb. 13(1): 31-56 (1993) - [j17]László Lovász, Miklós Simonovits:
Random Walks in a Convex Body and an Improved Volume Algorithm. Random Struct. Algorithms 4(4): 359-412 (1993) - 1992
- [j16]Ralph J. Faudree, Miklós Simonovits:
Ramsey problems and their connection to tuŕan-type extremal problems. J. Graph Theory 16(1): 25-50 (1992) - 1991
- [j15]Ervin Györi, János Pach, Miklós Simonovits:
On the maximal number of certain subgraphs inKr-free graphs. Graphs Comb. 7(1): 31-37 (1991) - [j14]Miklós Simonovits, Vera T. Sós:
Szemerédi's Partition and Quasirandomness. Random Struct. Algorithms 2(1): 1-10 (1991) - 1990
- [j13]László Babai, Miklós Simonovits, Joel Spencer:
Extremal subgraphs of random graphs. J. Graph Theory 14(5): 599-622 (1990) - 1988
- [j12]Richard H. Schelp, Miklós Simonovits, Vera T. Sós:
Intersection Theorems for t-Valued Functions. Eur. J. Comb. 9(6): 531-536 (1988) - 1984
- [j11]Miklós Simonovits, Vera T. Sós:
On restricted colourings of Kn. Comb. 4(1): 101-110 (1984) - [j10]W. G. Brown, Miklós Simonovits:
Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures. Discret. Math. 48(2-3): 147-162 (1984) - 1983
- [j9]Ralph J. Faudree, Miklós Simonovits:
On a class of degenerate extremal graph problems. Comb. 3(1): 83-93 (1983) - [j8]Paul Erdös, Miklós Simonovits:
Supersaturated graphs and hypergraphs. Comb. 3(2): 181-192 (1983) - 1982
- [j7]Paul Erdös, Miklós Simonovits:
Compactness results in extremal graph theory. Comb. 2(3): 275-288 (1982) - 1981
- [j6]Miklós Simonovits, Vera T. Sós:
Intersection Properties of Subsets of Integers. Eur. J. Comb. 2(4): 363-372 (1981) - 1980
- [j5]Dwight Duffus, Ivan Rival, Miklós Simonovits:
Spanning retracts of a partially ordered set. Discret. Math. 32(1): 1-7 (1980) - [j4]Ronald L. Graham, Miklós Simonovits, Vera T. Sós:
A Note on the Intersection Properties of Subsets of Integers. J. Comb. Theory A 28(1): 106-110 (1980) - 1977
- [j3]Miklós Simonovits:
On paul turán's influence on graph theory. J. Graph Theory 1(2): 102-116 (1977) - 1974
- [j2]Miklós Simonovits:
Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions. Discret. Math. 7(3-4): 349-376 (1974) - 1973
- [j1]Paul Erdös, Miklós Simonovits:
On a valence problem in extremal graph theory. Discret. Math. 5(4): 323-334 (1973)
Conference and Workshop Papers
- 2000
- [c5]János Komlós, Ali Shokoufandeh, Miklós Simonovits, Endre Szemerédi:
The Regularity Lemma and Its Applications in Graph Theory. Theoretical Aspects of Computer Science 2000: 84-112 - 1998
- [c4]Andreas Brieden, Peter Gritzmann, Ravi Kannan, Victor Klee, László Lovász, Miklós Simonovits:
Approximation of Diameters: Randomization Doesn't Help. FOCS 1998: 244-251 - 1997
- [c3]Miklós Simonovits:
How to solve a Turán type extremal graph problem? (Linear decomposition). Contemporary Trends in Discrete Mathematics 1997: 283-305 - 1992
- [c2]László Lovász, Miklós Simonovits:
On the Randomized Complexity of Volume and Diameter. FOCS 1992: 482-491 - 1990
- [c1]László Lovász, Miklós Simonovits:
The Mixing Rate of Markov Chains, an Isoperimetric Inequality, and Computing the Volume. FOCS 1990: 346-354
Parts in Books or Collections
- 2013
- [p1]Miklós Simonovits:
Paul Erdős' Influence on Extremal Graph Theory. The Mathematics of Paul Erdős II 2013: 245-311
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
