( en | de | ru )

 

Disambiguation of "Nagle, Brendan"

Author of the publication

copydeleteadd this publication to your clipboard
On Even-Degree Subgraphs of Linear Hypergraphs.

, , , , , , , , and . Comb. Probab. Comput., 21 (1-2): 113-127 (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Brendan Herbst

Brendan Lovett

Brendan Erler

Brendan Creutz

Brendan Theunissen

 

Other publications of authors with the same name

Generalized Pattern Frequency in Large Permutations., , and . Electron. J. Comb., 20 (1): 28 (2013)Efficient Testing of Hypergraphs., , and . ICALP, volume 2380 of Lecture Notes in Computer Science, page 1017-1028. Springer, (2002)Weak hypergraph regularity and linear hypergraphs., , , and . J. Comb. Theory, Ser. B, 100 (2): 151-160 (2010)Hypergraph regularity and quasi-randomness., , , and . SODA, page 227-235. SIAM, (2009)An algorithmic hypergraph regularity lemma., , and . Random Struct. Algorithms, 52 (2): 301-353 (2018)Constructive Packings by Linear Hypergraphs., and . Comb. Probab. Comput., 22 (6): 829-858 (2013)On Even-Degree Subgraphs of Linear Hypergraphs., , , , , , , , and . Comb. Probab. Comput., 21 (1-2): 113-127 (2012)Bipartite Hansel results for hypergraphs., and . Eur. J. Comb., (2020)Integer and fractional packings in dense 3-uniform hypergraphs., , and . Random Struct. Algorithms, 22 (3): 248-310 (2003)On characterizing hypergraph regularity., , , and . Random Struct. Algorithms, 21 (3-4): 293-335 (2002)