Papers (with pdf links to recent ones)

Submitted (comments are welcome)

• (NEW!) On the chromatic number of triangle-free hypergraphs (with A. Frieze), submitted (22 pages)
• Coloring H-free hypergraphs (with T. Bohman, A. Frieze), submitted (17 pages)
• Hypergraphs with independent neighborhoods (with T. Bohman, A. Frieze, O. Pikhurko), submitted (12 pages)
• Simplex stability (with R. Ramadurai), submitted (15 pages)
• Set systems with union and intersection constraints (with R. Ramadurai), submitted (5 pages)
• Two-regular subgraphs of hypergraphs (with J. Verstraete), submitted (14 pages)
• Set systems without a simplex or a cluster (with P. Keevash), submitted (23 pages)
• Turan's theorem with colors (with A. Diwan), submitted (12 pages)
• When is an almost monochromatic K4 guaranteed? (with A. Kostochka), submitted (9 pages)

Accepted

• Extremal problems for t-partite and t-colorable hypergraphs (with J. Talbot), Electronic Journal of Combinatorics (10 pages)
• Quadruple systems with independent neighborhoods (with Z. Furedi and O. Pikhurko), Journal of Combinatorial Theory, Series A (10 pages)
• Combinatorial problems for horn clauses (with M. Langlois, R. Sloan, G. Turan), Tenth International Symposium on Artificial Intelligence and Mathematics (ISAIM 2008) (6 pages)
• Constructions of non-principal families in extremal hypergraph theory (with O. Pikhurko), Discrete Mathematics (Special Issue in honor of Miklos Simonovits' 60th birthday) (11 pages)

  2008

• 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
• 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
• 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
• Minimal paths and cycles in set-systems (with J. Verstraete), European Journal of Combinatorics, 28 (2007), no. 6, 1681--1693
• 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.
• 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