Embedding graphs into larger graphs: results, methods, and problems

Extremal Graph Theory is a very deep and wide area of modern combinatorics. It is very fast developing, and in this long but relatively short survey we select some of those results which either we feel very important in this field or which are new breakthrough results, or which --- for some other re...

Full description

Saved in:
Bibliographic Details
Main Authors Simonovits, Miklós, Szemerédi, Endre
Format Journal Article
LanguageEnglish
Published 04.12.2019
Subjects
Mathematics - Combinatorics
Online AccessGet full text

Cover

More Information
Summary:Extremal Graph Theory is a very deep and wide area of modern combinatorics. It is very fast developing, and in this long but relatively short survey we select some of those results which either we feel very important in this field or which are new breakthrough results, or which --- for some other reasons --- are very close to us. Some results discussed here got stronger emphasis, since they are connected to Lov\'asz (and sometimes to us).
DOI:10.48550/arxiv.1912.02068