Now showing items 1-1 of 1

    • Removal lemmas in sparse graphs 

      Lamaison Vidarte, Ander (Universitat Politècnica de Catalunya, 2015-07)
      Bachelor thesis
      Open Access
      In this work we explain and prove the graph removal lemma, both in its dense and sparse cases, and show how these can be applied to finite groups to obtain arithmetic removal lemmas. We show how the concept of regularity ...