Papers (with pdf links to recent ones)
Submitted (comments are welcome)

A splitting theorem for ordered hypergraphs
(with Z. Furedi, T. Jiang, A. Kostochka, J. Verstraete) (19 pages)

Extremal problems for convex geometric hypergraphs
and ordered hypergraphs
(with Z. Furedi, T. Jiang, A. Kostochka, J. Verstraete) (19 pages)

Maximum Hfree subgraphs
(with S. Mukherjee) (19 pages)

Polynomial to exponential transition in Ramsey theory
(with A. Razborov) (27 pages)

Ordered and convex geometric trees with linear extremal function
(with Z. Furedi, A. Kostochka, J. Verstraete) (14 pages)

Tight paths in convex geometric hypergraphs
(with Z. Furedi, T. Jiang, A. Kostochka, J. Verstraete) (12 pages)

Extremal theory of locally sparse multigraphs (with C. Terry)
(23 pages)

The ErdosHajnal hypergraph Ramsey problem (with A. Suk)
(12 pages)
Accepted

Hypergraphs not containing a tight tree with a bounded trunk II:
3trees with a trunk of size 2
(with Z. Furedi, T. Jiang, A. Kostochka, J. Verstraete) Discrete Applied Mathematics (12 pages)

A survey of hypergraph Ramsey problems (with A. Suk)
Discrete Mathematics and Applications, Springer Volume,
edited by Andrei Raigorodskii and Michael Th. Rassias
(22 pages)

Independence
number of graphs with a prescribed number of cliques (with T. Bohman) Electronic Journal of Combinatorics (8 pages)

The number of triple systems without even cycles (with L. Wang) Combinatorica
(23 pages)
 Discrete metric spaces: structure,
enumeration, and 01 laws (with C. Terry) Journal of Symbolic Logic (33 pages)
2019

Hypergraphs not containing a tight tree with a bounded trunk
(with Z. Furedi, T. Jiang, A. Kostochka, J. Verstraete) SIAM J. Discrete Math. 33 (2019), no. 2, 862873.

The ErdosSzekeres problem and an induced Ramsey question
(with A. Suk) Mathematika 65 (2019), no. 3, 702707

An extremal graph problem with a transcendental
solution (with C. Terry) Combin. Probab. Comput. 28 (2019), no. 2, 303324
2018

Multicolor sunflowers (with L. Wang)
Combin. Probab. Comput. 27 (2018), no. 6, 974987.

New lower bounds for hypergraph Ramsey numbers (with A. Suk)
Bull. Lond. Math. Soc. 50 (2018), no. 2, 189201

Constructions in Ramsey theory
(with A. Suk) J. Lond. Math. Soc. (2) 97 (2018), no. 2, 247257.
2017

On the sizeRamsey number of hypergraphs
(with A. Dudek, S. LaFleur, V. Rodl) J. Graph Theory 86 (2017), no. 1, 104121

Offdiagonal hypergraph Ramsey numbers
(with A. Suk) J. Combin. Theory Ser. B 125 (2017), 168177.

The structure of large intersecting families
(with A. Kostochka) Proc. Amer. Math. Soc. 145 (2017), no. 6,
23112321.
 Sparse hypergraphs with
low independence number
(with J. Cooper) Combinatorica 37 (2017), no. 1, 3140

Variants of the ErdosSzekeres and ErdosHajnal Ramsey problems
European J. Combin. 62 (2017), 197205.
 Eigenvalues of nonregular
linearquasirandom hypergraphs (with J. Lenz)
Discrete Math. 340 (2017), no. 2, 145153.
 Turan problems and shadows II:
trees (with A. Kostochka, J. Verstraete) J. Combin. Theory Ser. B
122 (2017), 457478.
2016
 Coloring triple systems with local conditions J. Graph Theory 81 (2016), no. 3, 307311.
 A survey of Turan problems
for expansions
(with J. Verstraete)
Recent trends in combinatorics, 117143, IMA Vol. Math. Appl., 159,
Springer, New York, 2016. Vii 706. ISBN: 9783319242965.
 The independent neighborhoods
process (with T. Bohman, M. Picollelli) Israel J. Math. 214 (2016), no. 1,
333357.
 Hamilton cycles in quasirandom hypergraphs
(with J. Lenz, R. Mycroft) Random Structures Algorithms 49 (2016), no. 2, 363378

Improved bounds for the Ramsey number of tight cycles versus cliques
Combin. Probab. Comput. 25 (2016), no. 5, 791796

Counting trees in graphs
(with J. Verstraete) Electron. J. Combin.
23 (3) (2016), #P3.39
 Coloring sparse hypergraphs
(with J. Cooper) SIAM J. Discrete Math. 30 (2016), no. 2, 11651180.
 Perfect Packings in Quasirandom
Hypergraphs II (with J. Lenz) Combin. Probab. Comput. 25 (2016),
no. 4, 595611
 Perfect Packings in
Quasirandom Hypergraphs I (with J. Lenz) J. Combin. Theory Ser. B
119 (2016), 155177.
 Inverse Expander Mixing for
Hypergraphs (with E. Cohen, P. Ralli, P. Tetali) Electron. J.
Combin. 23 (2) (2016), #P2.20
 Hypergraph Ramsey numbers: tight cycles versus
cliques (with V. Rodl) Bull. Lond. Math. Soc. 48 (2016), no. 1, 127134.
 On the chromatic thresholds
of hypergraphs (with
J. Balogh, J. Butterfield, P. Hu, J. Lenz) Combin. Probab. Comput. 25 (2016), no. 2, 172212.
2015
 List Coloring TriangleFree Hypergraphs
(with J. Cooper) Random Structures and Algorithms 47 (2015), no. 3, 487519
 The poset of hypergraph
quasirandomness (with J. Lenz) Random Structures and Algorithms
46 (2015), no. 4, 762800
 Turan problems and
shadows III: expansions of graphs
(with A. Kostochka, J. Verstraete) SIAM Journal on Discrete
Mathematics 29 (2015), no. 2, 868876.
 Eigenvalues and linear quasirandom
hypergraphs (with J. Lenz) Forum of Mathematics, Sigma (2015), Vol. 3, e2, 26 pages
 Turan Problems and
Shadows I: Paths and
Cycles
(with A. Kostochka, J. Verstraete) Journal of Combinatorial
Theory, Series A 129 (2015), 5779.
2014
 Spectral
extremal problems
for hypergraphs (with P. Keevash, J. Lenz)
Siam Journal on Discrete Mathematics 28 (2014), no. 4, 1838.1854.
 Counting independent sets in hypergraphs
(with J. Cooper, K. Dutta) Combinatorics, Probability and Computing
23 (2014), no. 4, 539.550.
 A Ramseytype result for geometric
lhypergraphs (with A. Suk) European Journal of Combinatorics 41 (2014), 232241 and
Graph drawing, 364375, Lecture Notes in Comput. Sci., 8242, Springer, Cham, 2013.
 Multicolor Ramsey numbers for complete
bipartite versus complete graphs
(with J. Lenz) Journal of Graph Theory 77 (2014), no. 1, 19.38.
 On generalized Ramsey numbers for
3uniform hypergraphs (with A. Dudek) Journal of Graph Theory 76 (2014), no. 3, 217.223.
 Counting independent sets in trianglefree
graphs (with J. Cooper), Proceedings of the American Mathematical Society
142 (2014), no. 10, 3325.3334.
 On independent sets in hypergraphs
(with A. Kostochka, J. Verstraete), Random Structures and Algorithms
44 (2014), no. 2, 224.239.
 Multicolor Ramsey numbers
for triple systems
(with M. Axenovich, A. Gyarfas, H. Liu) Discrete Math. 322 (2014), 6977.
 Specified Intersections
(with V. Rodl), Transactions of the American Mathematical Society
366 (2014), no. 1, 491.504.
2013
 Counting substructures II:
hypergraphs, Combinatorica 33 (2013), no. 5, 591.612. (57 pages) (Journal version is shorter with no Appendix)
 Coloring simple hypergraphs
(with A. Frieze) Journal of Combinatorial Theory, Series B 103 (2013),
no. 6, 767.794.
 Hypergraph Ramsey Numbers: Triangles versus Cliques (with A. Kostochka, J. Verstraete), Journal of Combinatorial Theory, Series A 120 (2013), no. 7, 1491–1507.
 Coloring the cube with rainbow cycles
(with R. Stading), Electronic Journal of Combinatorics
(2013), no. 2, Paper 4, 11 pp.
2012
 New lower bounds for the independence number of spars
e graphs and hypergraphs (with
K. Dutta, C.R. Subramanian), SIAM Journal on Discrete Math 26 (2012), no. 3, 1134–1147.
 Treeminimal graphs are almost regular (with D. Dellamonica Jr., P. Haxell, T. Luczak, B. Nagle, Y. Person, V. Rodl, M. Schacht), Journal of Combinatorics 3 (2012), no. 1, 49–62.
 On evendegree subgraphs of linear hypergraphs (with
D. Dellamonica, P. Haxell, T. Luczak, B. Nagle, Y. Person, V. Rodl, M. Schacht, J. Verstraete), Combinatorics, Probability and Computing 21 (2012), no. 12, 113–127
 The de BruijnErdos Theorem for hypergraphs
(with N. Alon, K. Mellinger, J. Verstraete), Designs,
Codes and Cryptography, 65, (2012) no. , 2332453
 Books versus Triangles,
Journal of Graph Theory 70 (2012), no. 2, 171179.
 The Turan number of F33 (with
P. Keevash), Combinatorics, Probability and Computing 21 (2012), no. 3,
451456.
 Almost all trianglefree triple systems
are tripartite (with J. Balogh), Combinatorica 32 (2012), no. 2, 143169.
 Twopart set systems
(with P. Erdos, D. Gerbner, N. Lemons, C. Palmer, B. Patkos), Electronic Journal of Combinatorics, 19 (2012) p 52
2011
 Almost all triple systems with
independent neighborhoods are semibipartite (with J. Balogh), Journal of Combinatorial Theory, Series A, 118 (2011), no. 4, 14941518
2010
 Counting substructures I: color critical graphs,
Advances in Mathematics 225 (2010) 27312740

Hypergraphs with independent neighborhoods
(with T. Bohman, A. Frieze, O. Pikhurko), Combinatorica 30 (2010), no. 3, 277293

Set systems without a simplex or a cluster
(with P. Keevash), Combinatorica 30 (2010), no. 2, 175200
 On Approximate Horn Formula Minimization
(with A. Bhattacharya, B. Dasgupta, G. Turan), ICALP 2010 (21 pages)
 Finding bipartite subgraphs
efficiently (with G. Turan), Information Processing Letters,
Volume 110, Issue 5, 1 February 2010, Pages 174177
 Coloring Hfree hypergraphs
(with T. Bohman, A. Frieze), Random Structures and Algorithms 36 (2010) 1125.
2009
 Bipartite Coverings and the Chromatic
Number (with S. Vishwanathan), Electronic Journal of Combinatorics, 16 (2009), #N34

Combinatorial problems for horn clauses
(with M. Langlois, R. Sloan, G. Turan), in: Graph Theory,
Computational Intelligence and Thought
(M.Lipshteyn, V.E.Levit, R.M.McConnell, eds.), Springer LNCS 5420,
2009, 5465.
 ErdosKoRado in Random
Hypergraphs (with J. Balogh, T. Bohman ), Combinatorics,
Probability and Computing 18 (2009), no. 5, 629646 (Special issue in honor of Tom Trotters 60th birthday)

Simplex stability (with R. Ramadurai), Combinatorics, Probability and
Computing 18 (2009), no. 3, 441454.

Tworegular subgraphs of hypergraphs
(with J. Verstraete), Journal of Combinatorial Theory, Series B 99 (2009), no. 3, 643655.

Set systems with union and intersection constraints
(with R. Ramadurai), Journal of Combinatorial Theory, Series B 99 (2009), no. 3, 639642
2008

Quadruple systems with independent neighborhoods
(with Z. Furedi and O. Pikhurko), Journal of Combinatorial Theory, Series A 115 (2008), no. 8, 15521560.
 On the chromatic number of simple trianglefree triple systems (with A. Frieze), Electronic Journal of Combinatorics 15 (2008), no. 1, Research Paper 121, 27 pp.

When is an almost monochromatic K4 guaranteed? (with A. Kostochka), Combinatorics, Probability and Computing 17, (2008), no. 6, 823830
 Constructions of nonprincipal families in extremal hypergraph theory (with O. Pikhurko), Discrete Mathematics, 308 (2008), no. 19, 44304434

Extremal problems for tpartite and tcolorable hypergraphs
(with J. Talbot), Electronic Journal of Combinatorics 15 (2008), no. 1, Research Paper 26,
9 pp

A new short proof of a theorem of Ahlswede and Khachatrian
(with J. Balogh), Journal of Combinatorial Theory, Series A, 115 (2008), no. 2, 326330
2007
 Forbidding complete hypergraphs as traces
(with Y. Zhao), Graphs and Combinatorics, 23 (2007), no. 6, 667679
 An intersection theorem for four sets , Advances in Mathematics, 215 (2007) no. 2, 601615
 Minimal paths and cycles in setsystems (with J. Verstraete),
European Journal of Combinatorics, 28 (2007) no.6, 16811693
 Codegree density of hypergraphs
(with Y. Zhao), Journal of Combinatorial Theory, Series A, 114 (2007), no. 6, 11181132
 A new generalization of Mantel's theorem to kgraphs
(with O. Pikhurko), Journal of Combinatorial Theory, Series B, 97 (2007), no. 4, 669678
 On the independence number of the ErdosRenyi and Projective Norm graphs and a related hypergraph
(with J. Williford), Journal of Graph Theory 56 (2007), no. 2, 113127

Efficient Algorithms for the Inverse Protein Folding
Problem on 2D and 3D Lattices (with P. Berman, B.
DasGupta, R. H. Sloan, G. Turan, Y. Zhang), Discrete Applied Mathematics, 155 (2007), no. 67, 719732.

On the VCdimension of uniform hypergraphs
(with Y. Zhao), Journal of Algebraic Combinatorics, 25 (2007), no. 1, 101110
 On the chromatic number and independence number of hypergraph products
(with V. Rodl), Journal of Combinatorial Theory, Series B, 97 (2007), no. 1, 151155
 Rainbow Turan Problems
(with P. Keevash, B. Sudakov, J. Verstraete), Combinatorics Probability and
Computing 16 (2007), 109126. Erratum to this paper.
 Structure and stability
of trianglefree set systems, Transactions of the American
Mathematical Society, 359 (2007), 275291.
2006

Set systems with no singleton intersection
(with P. Keevash and R. Wilson), SIAM Journal on Discrete Mathematics
20 (2006), no. 4, 10311041.
 On the edgebandwidth of graph products
(with J. Balogh, A. Pluhar), Theoretical Computer Science, 359 (2006) 4357
 Supersaturation for RamseyTuran Problems (with V. Rodl), Combinatorica, 26 (2006), no. 3, 315332
 Explicit constructions of triple systems for
RamseyTuran problems (with V. T. Sos),
Journal of Graph Theory, 52 (2006), no. 3, 211216
 ErdosKoRado for three sets,
Journal of Combinatorial Theory, Series A, 113 (2006), no. 3, 547550 (the journal version has some minor typos in it, involving the characterization of equality in Frankl's theorem and the ErdosKoRado theorem. These are corrected in the version posted here)
 The DNF Exception
Problem
(with G. Turan, Y. Zhao), Theoretical Computer Science, 352 (2006), no. 13, 8596.
 A hypergraph extension of
Turan's theorem, Journal of Combinatorial Theory, Series B, 96 (2006), no. 1, 122134
2005
 Proof of a conjecture of Erdos on triangles in set systems
(with J. Verstraete), Combinatorica, 25
(2005), no. 5, 599614
 The codegree density of the
Fano plane, Journal of Combinatorial Theory, Series B, 95 (2005), no. 2, 333337
 Nonuniform Turantype problems (with Y. Zhao), Journal of Combinatorial Theory, Series A, 111 (2005) 106110
 Constructions of bipartite graphs from
finite geometries (with K. Mellinger), Journal of Graph Theory 49 (2005), no. 1, 110.
2004
 A family of switch equivalent graphs
(with B. Guenin, P.
Tetali), Discrete Mathematics 288 (2004), no. 13, 2935.

Uniform edge distribution in hypergraphs is hereditary
(with V. Rodl), Electronic Journal of Combinatorics, 11 (2004), no. 1, Research Paper R55, 32pp. (electronic)
 Stability results for cancellative hypergraphs
(with
P. Keevash), Journal of Combinatorial Theory, Series B, 92 (2004) 163175
 An explicit construction for a Ramsey
problem , Combinatorica, 24 (2004), no. 2, 313324
 A hypergraph extension of the Bipartite Turan
problem (with J. Verstraete), Journal of Combinatorial Theory, Series A 106 (2004) no. 2,
237253
 How many disjoint 2edge paths must a cubic graph
have? (with A. Kelmans), Journal of Graph Theory 45 (2004), no. 1, 5779

Efficient Algorithms for the Inverse Protein Folding
Problem on 2D and 3D Lattices (with P. Berman, B.
DasGupta, R. H. Sloan, G. Turan, Y. Zhang), Fifteenth Annual
Combinatorial Pattern Matching (CPM) Symposium, LNCS 3109, pp. 244253, July 2004, and accepted in Discrete Applied Math
2003
 Coloring with threecolored subgraphs , Journal of Graph
Theory 42 (2003), no. 3, 193198
 On hypergraphs with every four points spanning at
most two triples, Electronic Journal of Combinatorics, 10
(2003), no. 1, Research Paper N10, 4 pp. (electronic)
 On a twosided Turan problem (with Y. Zhao),
Electronic Journal of Combinatorics,
10 (2003), no. 1, Research Paper R42, 17 pp. (electronic)
2002
 The Chromatic Spectrum of Mixed Hypergraphs (with
T. Jiang, Z. Tuza, V. Voloshin, D. B. West), Graphs and
Combinatorics, 18 (2002), no. 2, 309318
 New lower bounds for Ramsey numbers of graphs and
hypergraphs (with F. Lazebnik), Advances in Applied
Mathematics, 28 (2002), no. 34, 544559
 Some exact results and new asymptotics for
hypergraph Turan numbers , Combinatorics, Probability and
Computing, 11 (2002), no. 3, 299309
 On Restricted EdgeColorings of Bicliques (with D.
B. West), Kleitman and combinatorics: a celebration (Cambridge,
MA, 1999). Discrete Mathematics (2002), no. 23, 513529
 Generalizing the Ramsey Problem
through Diameter,
Electronic Journal of Combinatorics, 9 (2002), no. 1,
Research Paper 42, 10 pp. (electronic)
 On the Turan number of Triple Systems(with V.
Rodl), Journal of Combinatorial Theory, Series A, 100 (2002), no. 1,
136152
 Intersecting Curves in the Plane,
Graphs and Combinatorics, 18 (2002), no. 3, 583589
2001
 Minimal Completely Separating Systems of
kSets (with A. Kundgen, P. Tetali),
Journal of Combinatorial Theory, Series A, 93 (2001), no. 1, 192198
 Large induced forests in sparse graphs (with N.
Alon, R. Thomas), Journal of Graph Theory, 38 (2001), no. 3,
113123
 On the chromatic number of setsystems (with A.
Kostochka, V. Rodl, P. Tetali), Random Structures and
Algorithms, 19 (2001), no. 2, 8798
 Asymptotically optimal treepackings in regular graphs
(with A. Kelmans, B. Sudakov),
Electronic Journal of Combinatorics 8 (2001), no. 1, Research Paper
38, 8 pp. (electronic)
 Realizing Degree Imbalances in Directed Graphs
(with D. B. West, T. G. Will), Discrete Mathematics 239 (2001),
no. 13, 147153
2000
 Graphic Sequences that have a Realization with Large Clique
Number, Journal of Graph Theory, 34 (2000), no. 1, 2029
 On generalized Ramsey theory: the bipartite case
(with M. Axenovich, Z. Furedi), Journal of Combinatorial Theory, Series B, 79 (2000),
no. 1, 6686
 New Upper Bounds for a Canonical Ramsey Problem (with T.
Jiang), Combinatorica, 20 (1) (2000) 141146
 Multiple Vertex Coverings by Specified Induced Subgraphs
(with Z. Furedi, D. B. West), Journal of Graph Theory, 34
(2000), no. 2, 180190
 EdgeColoring Cliques with Many Colors on Subcliques (with
D. Eichhorn), Combinatorica, 20 (3) (2000) 441444
 EdgeBandwidth of Theta Graphs (with D. Eichhorn,
K. O'Bryant, D. B. West), Journal of Graph Theory, 35 (2000) 8998
 On the Number of Vertices with Specified Eccentricity
(with D. B. West), Graphs and Combinatorics, 16 (4) (2000)
441452
1999
 Signed Domination in Regular Graphs and SetSystems, (with
Z. Furedi), Journal of Combinatorial Theory, Series B, 76 (1999), no. 2,
223239
 Edge Bandwidth of Graphs (with T. Jiang, A. Shastri, D. B.
West),
SIAM Journal on Discrete Mathematics 12 (1999), no. 3, 307316
1998
 EdgeColoring Cliques with Three Colors on all 4cliques,
Combinatorica, 18 (1998), no. 2, 293296
 Connectivity and Separating Sets of Cages (with T.
Jiang), Journal of Graph Theory, 29 (1998), no. 1, 3544