Publications

  1. "Nordhaus-Gaddum inequalities for the number of cliques in a graph" Submitted.
    [Co-Authors: J. Cutler, L. Pebody]

  2. "Generalized Ramsey numbers of cycles, paths, and hypergraphs" Submitted.
    [Co-Authors: P. Bennett, E. Heath, S. Zerbib]

  3. "On the multicolor Ramsey numbers of balanced double stars" Submitted.
    [Co-Authors: L. DeBiasio, E. Oren-Dahan]

  4. "Larger matchings and independent sets in regular uniform hypergraphs of high girth" Submitted.
    [Co-Author: P. Bennett]

  5. "A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphs" European Journal of Combinatorics 120 (2024).
    [Co-Authors: L. DeBiasio, A. Lo]

  6. "Large monochromatic components in expansive hypergraphs" Combinatorics, Probability and Computing. Published online 2024:1-17.
    [Co-Author: L. DeBiasio]

  7. "Full Degree Spanning Trees in Random Regular Graphs" Discrete Applied Mathematics 353 (2024) 85-93.
    [Co-Author: S. Acquaviva]
    Code (maple worksheet)

  8. "Large monochromatic components in hypergraphs with large minimum codegree" Journal of Graph Theory 105 (2024), no.3, 367–372.
    [Co-Author: L. DeBiasio]

  9. "Rainbow spanning trees in randomly coloured G_{k-out}" SIAM Journal on Discrete Mathematics 38 (2024), no.1, 867–882.
    [Co-Authors: A. Frieze, P. Pralat]

  10. "The Matching Process and Independent Process in Random Regular Graphs and Hypergraphs" Electronic Journal of Combinatorics 30 (2023), no. 1, Paper No. 1.11, 28 pp.
    [Co-Author: P. Bennett]

  11. "New lower bounds on the size-Ramsey number of a path" Electronic Journal of Combinatorics 29 (2022), no. 1, Paper No. 1.18, 20 pp.
    [Co-Author: L. DeBiasio]

  12. "On the size Ramsey number of all cycles versus a path" Discrete Mathematics 344 (2021), no. 5, Paper No. 112322, 10 pp.
    [Co-Author E. Schudrich]
    Code

  13. "Hamiltonian Berge Cycles in Random Hypergraphs" Combinatorics, Probability and Computing 30 (2021), no. 2, 228–238.
    [Co-Authors: R. Berkowitz, P. Devlin, M. Schacht]

  14. "Zero Forcing Number of Random Regular Graphs" Journal of Combinatorics 12 (2021), no. 1, 85–116.
    [Co-Authors: P. Bennett, S. English, Calum MacRury, P. Pralat]

  15. "A note on a candy sharing game" (pdf), The Art Discrete and Applied Mathematics 4 (2021), no. 1, Paper No. 1.02, 7 pp.
    [Co-Author: J. DeGaetani]

  16. "The bipartite $K_{2,2}$-free process and bipartite Ramsey number $b(2,t)$" Electronic Journal of Combinatorics 27 (2020), no. 4, Paper No. 4.23, 13 pp..
    [Co-Author: P. Bennett]

  17. "A Ramsey Property of Random Regular and k-out Graphs" Journal of Graph Theory 93 (2020) 363-371.
    [Co-Author: M. Anastos]

  18. "A greedy algorithm for finding a large 2-matching on a random cubic graph." Journal of Graph Theory 88 (2018) 449-481.
    [Co-Authors: P. Bennett, T. Bohman, A. Frieze]

  19. "Rainbow perfect matchings and Hamilton cycles in the random geometric graph" Random Structures and Algorithms 51 (2017) 587-606.
    [Co-Authors: P. Bennett, X. Perez Gimenez, P. Pralat]

  20. "Partitioning random graphs into monochromatic components" The Electronic Journal of Combinatorics 24 (2017), no. 1, Paper 1.18, 25 pp.
    [Co-Author: L. DeBiasio]

  21. "The Total Acquisition Number of Random Graphs" The Electronic Journal of Combinatorics 23 (2016), no. 2, Paper 2.55.
    [Co-Authors: P. Bennett, A. Dudek, P. Pralat]

  22. "Lazy Cops and Robbers Played on Random Graphs and Graphs on Surfaces." (pdf) Journal of Combinatorics 7 (2016) no. 4, 627-642.
    [Co-Authors: A. Bonato, W.B. Kinnersley, P. Pralat]

  23. "Rainbow Arborescence in Random Digraphs" Journal of Graph Theory 83 (2016), no. 3, 251-265.
    [Co-Authors: P. Bennett, C. Cooper, A. Frieze, P. Pralat]

  24. "Rainbow Matchings and Hamilton Cycles in Random Graphs" Random Structures and Algorithms 48 (2016) no. 3, 503-523.
    [Co-Author: A. Frieze]

  25. "Lazy Cops and Robbers on Hypercubes." (pdf) Combinatorics, Probability and Computing 24 (2015), no. 6, 829-837.
    [Co-Authors: A. Bonato, W.B. Kinnersley, P. Pralat]

  26. "Power of k Choices and Rainbow Spanning Trees in Random Graphs" The Electronic Journal of Combinatorics, 22, 2015, P1.29
    [Co-Authors: P. Bennett, A. Frieze, P. Pralat]

  27. "Packing tree factors in random and pseudo-random graphs." The Electronic Journal of Combinatorics 21, 2014, P2.8.
    [Co-Authors: A. Frieze, M. Krivelevich, P. Loh]

  28. "The t-tone chromatic number of random graphs." Graphs and Combinatorics, 2013, DOI:10.1007/s00373-013-1341-9.
    [Co-Authors: P. Bennett, A. Dudek, A. Frieze]
    Preprint, Journal Version

  29. "Packing tight Hamilton cycles in uniform hypergraphs" SIAM Journal on Discrete Mathematics 26, 2012, 435-451.
    [Co-Author: A. Frieze]
    Preprint, Journal Version

  30. "On the Maximum Number of Edges in a Hypergraph with a Unique Perfect Matching." Discrete Mathematics 311, 2011, pp 2577-2580
    [Co-Authors: A. Dudek, Z. Yilma]

  31. "Graph Connectivity, Partial Words, and a Theorem of Fine and Wilf." Information and Computation, Vol. 206, 2008, pp 676-693
    [Co-Authors: F. Blanchet-Sadri, G. Sisodia]

    Other Writings