Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"Constructive removal lemma"”.

  1. A Hypergraph Regularity Method for Linear Hypergraphs

    Szemerédi's Regularity Lemma is powerful tool in Graph Theory, yielding many applications in areas such as Extremal Graph Theory, Combinatorial Number Theory and Theoretical Computer Science. Strong hypergraph extensions of graph regularity techniques were recently given by Nagle, Rödl, Schacht and …

    usf Repository record for A Hypergraph Regularity Method for Linear Hypergraphs (opens in a new tab)