Author pages are created from data sourced from our academic publisher partnerships and public sources.

Publications Influence

Share This Author

Cycles of even length in graphs

- J. A. Bondy, M. Simonovits
- Mathematics
- 1 April 1974

Abstract In this paper we solve a conjecture of P. Erdos by showing that if a graph G n has n vertices and at least 100kn 1+ 1 k edges, then G contains a cycle C 2 l of length 2 l for every integer l… Expand

Random Walks in a Convex Body and an Improved Volume Algorithm

- L. Lovász, M. Simonovits
- Mathematics, Computer Science
- Random Struct. Algorithms
- 1993

TLDR

Isoperimetric problems for convex bodies and a localization lemma

- R. Kannan, L. Lovász, M. Simonovits
- Computer Science, Mathematics
- Discret. Comput. Geom.
- 1 June 1995

TLDR

Szemeredi''s Regularity Lemma and its applications in graph theory

- J. Komlos, M. Simonovits
- Mathematics
- 7 April 1995

Szemer\''edi''s Regularity Lemma is an important tool in discrete mathematics. It says that, in some sense, all graphs can be approximated by random-looking graphs. Therefore the lemma helps in… Expand

Supersaturated graphs and hypergraphs

- P. Erdös, M. Simonovits
- Mathematics, Computer Science
- Comb.
- 1 June 1983

We shall consider graphs (hypergraphs) without loops and multiple edges. Let ℒ be a family of so called prohibited graphs and ex (n, ℒ) denote the maximum number of edges (hyperedges) a graph… Expand

Compactness results in extremal graph theory

- P. Erdös, M. Simonovits
- Mathematics, Computer Science
- Comb.
- 1 September 1982

TLDR

Random walks and an O*(n5) volume algorithm for convex bodies

- R. Kannan, L. Lovász, M. Simonovits
- Computer Science
- Random Struct. Algorithms
- 1997

TLDR

On a valence problem in extremal graph theory

- P. Erdös, M. Simonovits
- Computer Science, Mathematics
- Discret. Math.
- 1 August 1973

Let L Kinp be a p-chromatic graph and e be an edge of L such that L - e is (p-1)-chromatic If G^n is a graph of n vertices without containing L but containing K"p, then the minimum valence of G^n is =

On the number of complete subgraphs of a graph II

- L. Lovász, M. Simonovits
- Mathematics
- 1983

Generalizing some results of P. Erdős and some of L. Moser and J. W. Moon we give lower bounds on the number of complete p-graphs K p of graphs in terms of the numbers of vertices and edges. Further,… Expand

The History of Degenerate (Bipartite) Extremal Graph Problems

- Z. Furedi, M. Simonovits
- Mathematics
- 21 June 2013

This paper is a survey on Extremal Graph Theory, primarily focusing on the case when one of the excluded graphs is bipartite. On one hand we give an introduction to this field and also describe many… Expand

...

1

2

3

4

5

...