Papers to download
-
Miklós Simonovits,
How to compute the voume in high dimension?
SMP, 2003 (Copenhagen).
Math. Program. 97 (2003), no. 1-2, Ser. B, 337374.
[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.
Preprint.
[PS]
[PDF]
-
Miklós Simonovits and Vera T. Sós,
Szemerédi's partition and
quasirandomness. Random Structures Algorithms 2 (1991), no. 1,
1--10.
[PS]
[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]
-
W. G. Brown and M. Simonovits,
Extremal multigraph and digraph problems,
in Paul Erdős and his mathematics, II. Springer 2002
[PS] [PDF]
-
Some of my Favorite Erdős Theorems
and related results, theories
in Paul Erdős and his mathematics, II. Springer 2002
[PS] [PDF]
-
My Favorite Erdős Theorems: Long version of the previous paper
(Only a preliminary version)
[PS] [PDF]
-
Simonovits, Miklós;
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]
-
J. Komlós and M. Simonovits, 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. [PS]
[PDF]
-
J. Komlós, A. Shokoufandeh, M. Simonovits, E. Szemerédi:
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.
[PS] [PDF]
- Deuber, W. A.; Simonovits,
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]
-
Miklós Simonovits and Vera T. Sós:
A hierarchy of randomness for graphs.
Discrete Math. 303 (2005), no. 1-3, 209233.
[PDF]
----------
- P. Erdos and M. Simonovits: Cube supersaturated graphs and related
problems,
Progress in Graph Theory, (eds Bondy and Murty) Acad. Press, 1984.
[PDF from Erdos' homepage]
- Simonovits, Miklós: Extremal graph problems, degenerate extremal
problems, and supersaturated graphs
Progress in Graph Theory, (eds Bondy and Murty) Acad. Press, 1984.
[PDF]
-
Duffus, Dwight, Rival, Ivan, and Simonovits, M.: Spanning retracts
of a partially ordered set. Discrete Math. 32 (1980), no. 1, 17.
[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]
- Simonovits, Miklós: Extremal Graph Problems, Calgary Conference,
[PDF]
- Katona, Gyula, Nemetz, Tibor, and Simonovits, Miklós:
On a graph-problem of Turán (in a Hungarian), Mat. Lapok 15 (1964) 228-238.
[PDF]