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 Blow-up 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.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Cited by
38 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献