Concepedia

Removal Lemmas

Removal Lemmas is a foundational result in extremal combinatorics that asserts that for any fixed graph, the removal of a small number of edges suffices to eliminate all copies of the graph from a larger host graph, provided the original count of such copies is subquadratic in the number of vertices.

26

Publications

1.6K

Citations

34

Authors

29

Institutions

Publications per year

2017–2026

5

Variants

Graph Removal Lemmas

Parents

Publications

26

A survey of selected recent results on total domination in graphs

Michael A. Henning · Discrete Mathematics · 2008 · 305 citations

, , +11

A variant of the hypergraph removal lemma

Terence Tao · Journal of Combinatorial Theory Series A · 2006 · 191 citations

, , +6

Combinatorial theorems in sparse random sets

David Conlon, W. T. Gowers · Annals of Mathematics · 2016 · 179 citations

, , +16

A new proof of the graph removal lemma

Jacob Fox · Annals of Mathematics · 2011 · 169 citations · Full text

, , +9

Bounds for graph regularity and removal lemmas

David Conlon, Jacob Fox · Geometric and Functional Analysis · 2012 · 96 citations

, , +10

1–5 of 26

Authors

34

  1. JF
    Jacob Fox

    Massachusetts Institute of Technology, United States

    4 publications · 303 citations

    4

    h-index

  2. DK
    Daniel Král͏̌

    Charles University, Czechia

    3 publications · 156 citations

    3

    h-index

  3. TT
    Terence Tao

    University of California, Los Angeles, United States

    3 publications · 306 citations

    3

    h-index

  4. LV
    Lluís Vena

    Universitat Politècnica de Catalunya, Spain

    3 publications · 156 citations

    3

    h-index

  5. DC
    David Conlon

    University of Cambridge, United Kingdom

    3 publications · 308 citations

    3

    h-index

1–5 of 34

Institutions

29

  1. Charles University

    Prague, Czechia

    3 h-index

    3 publications

    156 citations

  2. Universitat Politècnica de Catalunya

    Barcelona, Spain

    3 h-index

    5 publications

    291 citations

  3. University of Cambridge

    Cambridge, United Kingdom

    3 h-index

    3 publications

    308 citations

  4. Massachusetts Institute of Technology

    Cambridge, United States

    3 h-index

    3 publications

    207 citations

  5. Humboldt-Universität zu Berlin

    Berlin, Germany

    2 h-index

    2 publications

    89 citations

  6. University of Oxford

    Oxford, United Kingdom

    2 h-index

    2 publications

    212 citations

  7. University of Toronto

    Toronto, Canada

    2 h-index

    2 publications

    42 citations

  8. University of Illinois Urbana-Champaign

    Urbana, United States

    2 h-index

    2 publications

    36 citations

1–8 of 29

Venues

  1. arXiv (Cornell University)

    Repository · 3 publications · 89 citations

    3

    h-index

  2. Discrete Mathematics

    2 publications · 316 citations

    2

    h-index

  3. Annals of Mathematics

    2 publications · 348 citations

    2

    h-index

  4. Journal of Combinatorial Theory Series A

    2 publications · 270 citations

    2

    h-index

  5. Random Structures and Algorithms

    1 publications · 47 citations

    1

    h-index

1–5