Papers (with pdf links to recent ones)

Preprints/Submitted (comments are welcome)

• Conflict-free Hypergraph Matchings and Coverings (with Felix Joos and Zak Smith) (23 pages)
• Off-diagonal Ramsey numbers for slowly growing hypergraphs (with Sam Mattheus, Jiaxi Nie, Jacques Verstraete) (11 pages)
• Erdos-Rogers functions for arbitrary pairs of graphs (with Jacques Verstraete) (15 pages)
• Inducibility of rainbow graphs (with Emily Cairncross, Clayton Mizgerd) (27 pages)
• Big line or big convex polygon (with David Conlon, Jacob Fox, Xiaoyu He, Andrew Suk, Jacques Verstraete) (11 pages)
• A question of Erdos and Graham on Egyptian fractions (with David Conlon, Jacob Fox, Xiaoyu He, Huy Tuan Pham, Andrew Suk, Jacques Verstraete) (8 pages)
• On off-diagonal hypergraph Ramsey numbers (with David Conlon, Jacob Fox, Ben Gunby, Xiaoyu He, Andrew Suk, Jacques Verstraete) (22 pages)
• Random Turan theorem for hypergraph cycles (with L. Yepremyan) (16 pages)

Accepted

• On the orders of the classical Erdos-Rogers functions (with Jacques Verstraete) Bull. Lond. Math. Soc. (16 pages)
• Ordered and colored subgraph density problems (with Emily Cairncross) SIAM J. Discrete Math. (17 pages)
• Turan problems in pseudorandom graphs (with Xizhi Liu and David Munha Correia) Combin. Probab. Comput. (16 pages)
• Hypergraphs with many extremal configurations (with X. Liu, C. Reiher) Israel. J. Math. (34 pages)
• Ramsey theory constructions from hypergraph matchings (with Felix Joos) Proc. Amer. Math. Soc. (11 pages)

2024

• Ramsey numbers and the Zarankiewicz problem (with David Conlon, Sam Mattheus, Jacques Verstraete) Bull. Lond. Math. Soc. 56 (2024), no. 6 2014--2023
• Set-coloring Ramsey numbers via codes (with David Conlon, Jacob Fox, Xiaoyu He, Andrew Suk, Jacques Verstraete) Studia Scientiarum Mathematicarum Hungarica. 61 (2024), no. 1, 1--15.
• Large cliques or co-cliques in hypergraphs with forbidden order-size pairs (with Maria Axenovich, Domagoj Bradac, Lior Gishboliner, Lea Weber) Combin. Probab. Comput. 33 (2024), 286--299.
• A note on pseudorandom Ramsey graphs (with J. Verstraete) J. Eur. Math. Soc. (JEMS) 26 (2024), no. 1, 153--161.
  See here for an article in Quanta magazine that mentions this work
• Coloring unions of nearly disjoint hypergraph cliques (with Jacques Verstraete) Mathematika 70 (2024), no. 1, Paper No. e12234, 12 pp.
• Ramsey numbers of cliques versus monotone paths (with Andrew Suk) European J. Combin. 118 (2024), 103922, 7 pages.

2023

• Hypergraphs with infinitely many extremal constructions (with Jianfeng Hou, Heng Li, Xizhi Liu, Yixiao Zhang) Discrete Analysis (2023), Paper No. 18, 34 pp.
• Extremal problems for hypergraph blowups of trees (with Z. Furedi, T. Jiang, A. Kostochka, J. Verstraete) SIAM J. Discrete Math. 37 (2023), no. 4, 2397--2416.
• Hypergraph Ramsey numbers of cliques versus stars (with David Conlon, Jacob Fox, Xiaoyu He, Andrew Suk, Jacques Verstraete) Random Structures Algorithms 63 (2023), no. 3, 610--623.
• Triangles in graphs without bipartite suspensions (with S. Mukherjee) Discrete Math. 346 (2023), no. 6, Paper No. 113355, 19 pp.
• The feasible region of induced graphs (with X. Liu, C. Reiher) J. Combin. Theory Ser. B 158 (2023), 105--135.
• A unified approach to hypergraph stability (with X. Liu, C. Reiher) J. Combin. Theory Ser. B 158 (2023), 36--62.

2022

• A hypergraph Turan problem with no stability (with X. Liu) Combinatorica 42 (2022), no. 3, 433--462.
• Independent sets in hypergraphs omitting an intersection (with T. Bohman, X. Liu) Random Structures Algorithms 61 (2022), no. 3, 493--519.
• A note on the Erdos-Hajnal hypergraph Ramsey problem (with A. Suk, E. Zhu) Proc. Amer. Math. Soc. 150 (2022), no. 9, 3675--3685
• On a generalized Erdos-Rademacher problem (with X. Liu) J. Graph Theory 100 (2022), no. 1, 101--126.
• On explicit constructions of designs (with X. Liu) Electron. J. Combin. 29 (2022), no. 1, Paper No. 1.53, 11 pp.
• Extremal problems for pairs of triangles in a convex polygon (with Z. Furedi, J. O'Neill, J. Verstraete) J. Combin. Theory Ser. B 155 (2022), 83--110

2021

• Polynomial to exponential transition in Ramsey theory (with A. Razborov) Proc. Lond. Math. Soc. (3) 122 (2021), no. 1, 69--92.
• Cliques with many colors in triple systems (with A. Suk) J. Comb. (2021), no. 4, 563--569.
• Extremal problems for convex geometric hypergraphs and ordered hypergraphs (with Z. Furedi, T. Jiang, A. Kostochka, J. Verstraete) Canad. J. Math. 73 (2021), no. 6, 1648--1666.
• Maximum H-free subgraphs (with S. Mukherjee) J. Comb. 12 (2021), no. 2, 185--214.
• Tight bounds for Katona's shadow intersection theorem (with X. Liu) European J. Combin. 97 (2021), Paper No. 103391, 17 pp.
• The feasible region of hypergraphs (with X. Liu) J. Combin. Theory Ser. B 148 (2021), 23--59.
• Partitioning ordered hypergraphs (with Z. Furedi, T. Jiang, A. Kostochka, J. Verstraete) J. Combin. Theory Ser. A 177 (2021), 105300, 18pp.

2020

• The Erdos-Hajnal hypergraph Ramsey problem (with A. Suk) J. Eur. Math. Soc. (JEMS) 22 (2020), no. 4, 1247--1259
• A survey of hypergraph Ramsey problems (with A. Suk) Discrete mathematics and applications, 405--428, Springer Optim. Appl., 165, Springer, Cham, [2020],
• Extremal theory of locally sparse multigraphs (with C. Terry) SIAM J. Discrete Math. 34 (2020), no. 3, 1922--1943.
• Ordered and convex geometric trees with linear extremal function (with Z. Furedi, A. Kostochka, J. Verstraete) Discrete Comput. Geom. (2020), no. 2, 324--338 (Branko Grunbaum memorial volume)
• Tight paths in convex geometric hypergraphs (with Z. Furedi, T. Jiang, A. Kostochka, J. Verstraete) Adv. Comb. 2020, Paper No. 1--13, www.advancesincombinatorics.com
• Hypergraphs not containing a tight tree with a bounded trunk II: 3-trees with a trunk of size 2 (with Z. Furedi, T. Jiang, A. Kostochka, J. Verstraete) Discrete Appl. Math. 276 (2020), 50--59.

2019

• Discrete metric spaces: structure, enumeration, and 0-1 laws (with C. Terry) Journal of Symbolic Logic 84 (2019), no. 4, 1293--1325.
• The number of triple systems without even cycles (with L. Wang) Combinatorica 39 (2019), no. 3, 679--704.
• Independence number of graphs with a prescribed number of cliques (with T. Bohman) Electron. J. Combin. 26 (2019), no. 2, Paper 2.25, 7 pp.
• 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, 862--873.
• The Erdos-Szekeres problem and an induced Ramsey question (with A. Suk) Mathematika 65 (2019), no. 3, 702--707
• An extremal graph problem with a transcendental solution (with C. Terry) Combin. Probab. Comput. 28 (2019), no. 2, 303--324

2018

• Multicolor sunflowers (with L. Wang) Combin. Probab. Comput. 27 (2018), no. 6, 974--987.
• New lower bounds for hypergraph Ramsey numbers (with A. Suk) Bull. Lond. Math. Soc. 50 (2018), no. 2, 189--201
• Constructions in Ramsey theory (with A. Suk) J. Lond. Math. Soc. (2) 97 (2018), no. 2, 247--257.

2017

• On the size-Ramsey number of hypergraphs (with A. Dudek, S. La-Fleur, V. Rodl) J. Graph Theory 86 (2017), no. 1, 104--121
• Off-diagonal hypergraph Ramsey numbers (with A. Suk) J. Combin. Theory Ser. B 125 (2017), 168--177.
• The structure of large intersecting families (with A. Kostochka) Proc. Amer. Math. Soc. 145 (2017), no. 6, 2311--2321.
• Sparse hypergraphs with low independence number (with J. Cooper) Combinatorica 37 (2017), no. 1, 31--40
• Variants of the Erdos-Szekeres and Erdos-Hajnal Ramsey problems European J. Combin. 62 (2017), 197--205.
• Eigenvalues of non-regular linear-quasirandom hypergraphs (with J. Lenz) Discrete Math. 340 (2017), no. 2, 145--153.
• Turan problems and shadows II: trees (with A. Kostochka, J. Verstraete) J. Combin. Theory Ser. B 122 (2017), 457--478.

2016

• Coloring triple systems with local conditions J. Graph Theory 81 (2016), no. 3, 307--311.
• A survey of Turan problems for expansions (with J. Verstraete) Recent trends in combinatorics, 117--143, IMA Vol. Math. Appl., 159, Springer, New York, 2016. Vii 706. ISBN: 978-3-319-24296-5.
• The independent neighborhoods process (with T. Bohman, M. Picollelli) Israel J. Math. 214 (2016), no. 1, 333--357.
• Hamilton cycles in quasirandom hypergraphs (with J. Lenz, R. Mycroft) Random Structures Algorithms 49 (2016), no. 2, 363-378
• Improved bounds for the Ramsey number of tight cycles versus cliques Combin. Probab. Comput. 25 (2016), no. 5, 791--796
• 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, 1165--1180.
• Perfect Packings in Quasirandom Hypergraphs II (with J. Lenz) Combin. Probab. Comput. 25 (2016), no. 4, 595--611
• Perfect Packings in Quasirandom Hypergraphs I (with J. Lenz) J. Combin. Theory Ser. B 119 (2016), 155--177.
• 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, 127--134.
• On the chromatic thresholds of hypergraphs (with J. Balogh, J. Butterfield, P. Hu, J. Lenz) Combin. Probab. Comput. 25 (2016), no. 2, 172--212.

2015

• List Coloring Triangle-Free Hypergraphs (with J. Cooper) Random Structures and Algorithms 47 (2015), no. 3, 487--519
• The poset of hypergraph quasirandomness (with J. Lenz) Random Structures and Algorithms 46 (2015), no. 4, 762--800
• Turan problems and shadows III: expansions of graphs (with A. Kostochka, J. Verstraete) SIAM Journal on Discrete Mathematics 29 (2015), no. 2, 868--876.
• 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), 57--79.

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 Ramsey-type result for geometric l-hypergraphs (with A. Suk) European Journal of Combinatorics 41 (2014), 232-241 and Graph drawing, 364-375, 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 3-uniform hypergraphs (with A. Dudek) Journal of Graph Theory 76 (2014), no. 3, 217.223.
• Counting independent sets in triangle-free 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), 69--77.
• 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.
• Tree-minimal 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 even-degree 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. 1-2, 113–127
• The de Bruijn-Erdos Theorem for hypergraphs (with N. Alon, K. Mellinger, J. Verstraete), Designs, Codes and Cryptography, 65, (2012) no. , 233--2453
• Books versus Triangles, Journal of Graph Theory 70 (2012), no. 2, 171--179.
• The Turan number of F33 (with P. Keevash), Combinatorics, Probability and Computing 21 (2012), no. 3, 451--456.
• Almost all triangle-free triple systems are tripartite (with J. Balogh), Combinatorica 32 (2012), no. 2, 143-169.
• Two-part 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 semi-bipartite (with J. Balogh), Journal of Combinatorial Theory, Series A, 118 (2011), no. 4, 1494-1518

2010

• Counting substructures I: color critical graphs, Advances in Mathematics 225 (2010) 2731-2740
• Hypergraphs with independent neighborhoods (with T. Bohman, A. Frieze, O. Pikhurko), Combinatorica 30 (2010), no. 3, 277-293
• Set systems without a simplex or a cluster (with P. Keevash), Combinatorica 30 (2010), no. 2, 175-200
• 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 174-177
• Coloring H-free hypergraphs (with T. Bohman, A. Frieze), Random Structures and Algorithms 36 (2010) 11-25.

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, 54-65.
• Erdos-Ko-Rado in Random Hypergraphs (with J. Balogh, T. Bohman ), Combinatorics, Probability and Computing 18 (2009), no. 5, 629--646 (Special issue in honor of Tom Trotters 60th birthday)
• Simplex stability (with R. Ramadurai), Combinatorics, Probability and Computing 18 (2009), no. 3, 441--454.
• Two-regular subgraphs of hypergraphs (with J. Verstraete), Journal of Combinatorial Theory, Series B 99 (2009), no. 3, 643--655.
• Set systems with union and intersection constraints (with R. Ramadurai), Journal of Combinatorial Theory, Series B 99 (2009), no. 3, 639--642

2008

• Quadruple systems with independent neighborhoods (with Z. Furedi and O. Pikhurko), Journal of Combinatorial Theory, Series A 115 (2008), no. 8, 1552--1560.
• On the chromatic number of simple triangle-free 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, 823-830
• Constructions of nonprincipal families in extremal hypergraph theory (with O. Pikhurko), Discrete Mathematics, 308 (2008), no. 19, 4430--4434
• Extremal problems for t-partite and t-colorable 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, 326--330

2007

• Forbidding complete hypergraphs as traces (with Y. Zhao), Graphs and Combinatorics, 23 (2007), no. 6, 667--679
• An intersection theorem for four sets , Advances in Mathematics, 215 (2007) no. 2, 601--615
• Minimal paths and cycles in set-systems (with J. Verstraete), European Journal of Combinatorics, 28 (2007) no.6, 1681--1693
• Co-degree density of hypergraphs (with Y. Zhao), Journal of Combinatorial Theory, Series A, 114 (2007), no. 6, 1118--1132
• A new generalization of Mantel's theorem to k-graphs (with O. Pikhurko), Journal of Combinatorial Theory, Series B, 97 (2007), no. 4, 669--678
• On the independence number of the Erdos-Renyi and Projective Norm graphs and a related hypergraph (with J. Williford), Journal of Graph Theory 56 (2007), no. 2, 113--127
• 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. 6-7, 719--732.
• On the VC-dimension of uniform hypergraphs (with Y. Zhao), Journal of Algebraic Combinatorics, 25 (2007), no. 1, 101--110
• On the chromatic number and independence number of hypergraph products (with V. Rodl), Journal of Combinatorial Theory, Series B, 97 (2007), no. 1, 151--155
• Rainbow Turan Problems (with P. Keevash, B. Sudakov, J. Verstraete), Combinatorics Probability and Computing 16 (2007), 109--126. Erratum to this paper.
• Structure and stability of triangle-free set systems, Transactions of the American Mathematical Society, 359 (2007), 275-291.

2006

• Set systems with no singleton intersection (with P. Keevash and R. Wilson), SIAM Journal on Discrete Mathematics 20 (2006), no. 4, 1031--1041.
• On the edge-bandwidth of graph products (with J. Balogh, A. Pluhar), Theoretical Computer Science, 359 (2006) 43--57
• Supersaturation for Ramsey-Turan Problems (with V. Rodl), Combinatorica, 26 (2006), no. 3, 315--332
• Explicit constructions of triple systems for Ramsey-Turan problems (with V. T. Sos), Journal of Graph Theory, 52 (2006), no. 3, 211--216
• Erdos-Ko-Rado for three sets, Journal of Combinatorial Theory, Series A, 113 (2006), no. 3, 547--550 (the journal version has some minor typos in it, involving the characterization of equality in Frankl's theorem and the Erdos-Ko-Rado theorem. These are corrected in the version posted here)
• The DNF Exception Problem (with G. Turan, Y. Zhao), Theoretical Computer Science, 352 (2006), no. 1-3, 85--96.
• A hypergraph extension of Turan's theorem, Journal of Combinatorial Theory, Series B, 96 (2006), no. 1, 122--134

2005

• Proof of a conjecture of Erdos on triangles in set systems (with J. Verstraete), Combinatorica, 25 (2005), no. 5, 599--614
• The co-degree density of the Fano plane, Journal of Combinatorial Theory, Series B, 95 (2005), no. 2, 333--337
• Nonuniform Turan-type problems (with Y. Zhao), Journal of Combinatorial Theory, Series A, 111 (2005) 106--110
• Constructions of bipartite graphs from finite geometries (with K. Mellinger), Journal of Graph Theory 49 (2005), no. 1, 1--10.

2004

• A family of switch equivalent graphs (with B. Guenin, P. Tetali), Discrete Mathematics 288 (2004), no. 1-3, 29--35.
• 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) 163--175
• An explicit construction for a Ramsey problem , Combinatorica, 24 (2004), no. 2, 313--324
• A hypergraph extension of the Bipartite Turan problem (with J. Verstraete), Journal of Combinatorial Theory, Series A 106 (2004) no. 2, 237--253
• How many disjoint 2-edge paths must a cubic graph have? (with A. Kelmans), Journal of Graph Theory 45 (2004), no. 1, 57-79
• 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. 244--253, July 2004, and accepted in Discrete Applied Math

2003

• Coloring with three-colored subgraphs , Journal of Graph Theory 42 (2003), no. 3, 193--198
• 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 two-sided 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, 309--318
• New lower bounds for Ramsey numbers of graphs and hypergraphs (with F. Lazebnik), Advances in Applied Mathematics, 28 (2002), no. 3-4, 544--559
• Some exact results and new asymptotics for hypergraph Turan numbers , Combinatorics, Probability and Computing, 11 (2002), no. 3, 299--309
• On Restricted Edge-Colorings of Bicliques (with D. B. West), Kleitman and combinatorics: a celebration (Cambridge, MA, 1999). Discrete Mathematics (2002), no. 2-3, 513--529
• 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, 136--152
• Intersecting Curves in the Plane, Graphs and Combinatorics, 18 (2002), no. 3, 583--589

2001

• Minimal Completely Separating Systems of k-Sets (with A. Kundgen, P. Tetali), Journal of Combinatorial Theory, Series A, 93 (2001), no. 1, 192--198
• Large induced forests in sparse graphs (with N. Alon, R. Thomas), Journal of Graph Theory, 38 (2001), no. 3, 113--123
• On the chromatic number of set-systems (with A. Kostochka, V. Rodl, P. Tetali), Random Structures and Algorithms, 19 (2001), no. 2, 87--98
• Asymptotically optimal tree-packings 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. 1-3, 147--153

2000

• Graphic Sequences that have a Realization with Large Clique Number, Journal of Graph Theory, 34 (2000), no. 1, 20--29
• On generalized Ramsey theory: the bipartite case (with M. Axenovich, Z. Furedi), Journal of Combinatorial Theory, Series B, 79 (2000), no. 1, 66--86
• New Upper Bounds for a Canonical Ramsey Problem (with T. Jiang), Combinatorica, 20 (1) (2000) 141--146
• Multiple Vertex Coverings by Specified Induced Subgraphs (with Z. Furedi, D. B. West), Journal of Graph Theory, 34 (2000), no. 2, 180--190
• Edge-Coloring Cliques with Many Colors on Subcliques (with D. Eichhorn), Combinatorica, 20 (3) (2000) 441--444
• Edge-Bandwidth of Theta Graphs (with D. Eichhorn, K. O'Bryant, D. B. West), Journal of Graph Theory, 35 (2000) 89--98
• On the Number of Vertices with Specified Eccentricity (with D. B. West), Graphs and Combinatorics, 16 (4) (2000) 441-452

1999

• Signed Domination in Regular Graphs and Set-Systems, (with Z. Furedi), Journal of Combinatorial Theory, Series B, 76 (1999), no. 2, 223--239
• Edge Bandwidth of Graphs (with T. Jiang, A. Shastri, D. B. West), SIAM Journal on Discrete Mathematics 12 (1999), no. 3, 307--316

1998

• Edge-Coloring Cliques with Three Colors on all 4-cliques, Combinatorica, 18 (1998), no. 2, 293--296
• Connectivity and Separating Sets of Cages (with T. Jiang), Journal of Graph Theory, 29 (1998), no. 1, 35--44