University of South Florida - click to return to home page
 
Search the USF Web siteUSF Site mapUSF home page


Home

CV

Abstract Algebra

Linear Algebra


 

Minimum Requirements for Admission

List of Publications

On algorithmic hypergraph regularity, SODA'09, to appear (with A. Poerschke, V. Rodl and M. Schacht)

Hereditary properties of hypergraphs, J. Combin. Theory Ser. B, to appear (with R. Dotson)

On the Ramsey number of sparse 3-graphs, Graphs Combin. 24 (2008) no.3, 205-228. (with S. Olsen, V. Rodl and M. Schacht)

An algorithmic version of the hypergraph regularity method, Siam J. Comput. 37 (2008), no.6, 1728-1776 (with P. Haxell and V. Rodl)

Note on the 3-graph Counting Lemma, Discrete Math. 308 (2008), 4501-4517 (with V. Rodl and M. Schacht)

Extremal hypergraph problems and the regularity method, in M. Klazar, J. Kratochvil, M. Loebl, J. Matousek, R. Thomas, P. Valtr (eds): Topics in Discrete Mathematics 26, Algorithms Combin., 247-278, Springer, Berlin (with V. Rodl and M. Schacht)

The counting lemma for regular k-uniform hypergraphs, Rand. Struct. Algorithms 28 (2006), no. 2, 113-179 (with V. Rodl and M. Schacht)

The hypergraph regularity method and its applications, Proceedings of the National Academy of Science 102 (2005), no. 23, 8109-8113 (with V. Rodl,      J. Skokan, M. Schacht and Y. Kohayakawa)

An algorithmic version of the hypergraph regularity method [extended abstract], FOCS, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS' 05), 2005, 439-448 (with P. Haxell and V. Rodl)

Bounding the strong chromatic index of dense random graphs, Discrete Math. 281 (2004), no. 1-3, 129-136 (with A. Czygrinow)

Strong edge colorings of uniform graphs, Discrete Math. 286 (2004), no. 3, 219-223 (with A. Czygrinow)

Matrix-free proof of a regularity characterization, Electron. J. Combin. 10 (2003), Research Paper 39, 11 pp (electronic) (with A. Czygrinow)

Hereditary properties of triple systems, Combin. Probab. Comput. 12 (2003), 248-310 (with Y. Kohayakawa and V. Rodl)

Regularity properties for triple systems, Rand. Struct. Algorithms 23 (2003), no. 3, 264-332 (with V. Rodl)

On characterizing hypergraph regularity, Rand. Struct. Algorithms 21 (2002), no. 3-4, 293-335 (with Y. Dementieva, P. Haxell and V. Rodl)

Fractional packings in dense 3-uniform hypergraphs, Rand. Struct. Algorithms 22 (2002), no. 3, 293-335 (with P. Haxell and V. Rodl)

Efficient testing of hypergraphs, ICALP 2002, 29th International Colloquium on Automata, Languages and Programming (Malaga, Spain), July 2002, Lecture Notes in Computer Science 2286, Springer, Berlin (2002), 278-293                     (with Y. Kohayakawa and V. Rodl)

A note on codegree problems for hypergraphs, Bull. Inst. Combin. Appl. 32 (2001), 63-69 (with A. Czygrinow)

The asymptotic number of triple systems not containing a fixed one, Discrete Math. 235 (2001), 271-290 (with V. Rodl)

Turan related problems for hypergraphs, Congr. Numer. 136 (1999), 119-127.

 
       
spacer
Brendan Nagle, Department of Mathematics and Statistics, 4202 E. Fowler Avenue, PHY114, Tampa, FL 33620
spacer
Direct questions or comments about the Web site to Brendan Nagle 
spacer
Copyright © 2006, University of South Florida