Article
Embedding spanning subgraphs of small bandwidth.
Zentrum Mathematik, Technische Universität München, Boltzmannstraße 3, D85747 Garching bei München, Germany
Electronic Notes in Discrete Mathematics 01/2007; 29:485489. DOI: 10.1016/j.endm.2007.07.075 Source: DBLP
 Citations (11)
 Cited In (0)

Article: The Blowup Lemma
[Show abstract] [Hide abstract]
ABSTRACT: Extremal graph theory has a great number of conjectures concerning the embedding of large sparse graphs into dense graphs. Szemerédi's Regularity Lemma is a valuable tool in finding embeddings of small graphs. The Blowup Lemma, proved recently by Komlós, Sárközy and Szemerédi, can be applied to obtain approximate versions of many of the embedding conjectures. In this paper we review recent developments in the area.Combinatorics Probability and Computing 01/1999; 8(1&2). · 0.61 Impact Factor 
Conference Paper: The Regularity Lemma and Its Applications in Graph Theory.
[Show abstract] [Hide abstract]
ABSTRACT: Szemerédi’s Regularity Lemma is an important tool in discrete mathematics. It says that, in some sense, all graphs can be approximated by randomlooking graphs. Therefore the lemma helps in proving theorems for arbitrary graphs whenever the corresponding result is easy for random graphs. In the last few years more and more new results were obtained by using the Regularity Lemma, and also some new variants and generalizations appeared. Komlós and Simonovits have written a survey on the topic [96]. The present survey is, in a sense, a continuation of the earlier survey. Here we describe some sample applications and generalizations. To keep the paper selfcontained we decided to repeat (sometimes in a shortened form) parts of the first survey, but the emphasis is on new results.Theoretical Aspects of Computer Science, Advanced Lectures (First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000); 01/2000 
Article: Some Theorems on Abstract Graphs
Proceedings of the London Mathematical Society 01/1952; · 1.12 Impact Factor
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.