Brendan Nagle

The counting lemma for regular k-uniform hypergraphs

Brendan Nagle, Vojtěch Rödl, Mathias Schacht · 2004 · 227 citations

The counting lemma for regular<i>k</i>‐uniform hypergraphs

Brendan Nagle, Vojtěch Rödl, Mathias Schacht · Random Structures and Algorithms · 2006 · 125 citations

Weak hypergraph regularity and linear hypergraphs

Yoshiharu Kohayakawa, Brendan Nagle, Vojtěch Rödl et al. · Journal of Combinatorial Theory Series B · 2009 · 80 citations

Graph Sparsity, Weak Hypergraph Regularity, Graph Theory +4

The hypergraph regularity method and its applications

V. Rödl, Brendan Nagle, Jozef Skokan et al. · Proceedings of the National Academy of Sciences · 2005 · 43 citations · Full text

Regularity properties for triple systems

Brendan Nagle, Vojtěch Rödl · Random Structures and Algorithms · 2003 · 41 citations

Engineering, Graph Theory, Algebraic Graph Theory +13