I am mostly interested in graph theory, extremal combinatorics, and probabilistic combinatorics. My Erdős number is at most 2!
Papers and preprints
If you are looking for a link to a paper, try checking my arXiv.
- Dirac’s Theorem for hamiltonian Berge cycles in uniform hypergraphs. (with Alexandr Kostochka and Grace McCourt) preprint.
- Forbidding K_{2,t}- traces in triple systems. (with Sam Spiro) Electronic Journal of Combinatorics.
- Large monochromatic components in almost complete graphs and bipartite graphs. (with Zoltan Furedi) Electronic Journal of Combinatorics.
- Induced Turán problems and traces of hypergraphs. (with Zoltan Furedi) preprint.
- Conditions for a bigraph to be super-cyclic. (with Alexandr Kostochka, Mikhail Lavrov, and Dara Zirlin) Electronic Journal of Combinatorics.
- Longest cycles in 3-connected hypergraphs and bipartite graphs. (with Alexandr Kostochka, Mikhail Lavrov, and Dara Zirlin) Journal of Graph theory.
- Berge cycles in non-uniform hypergraphs. (with Zoltan Furedi and Alexandr Kostochka) Electronic Journal of Combinatorics.
- Towards the Small Quasi-Kernel Conjecture. (with Alexandr Kostochka and Songling Shan) preprint.
- Super-pancyclic hypergraphs and bipartite graphs. (with Alexandr Kostochka and Dara Zirlin) Journal of Combinatorial Theory, Series B.
- On 2-connected hypergraphs with no long cycles. (with Zoltan Furedi and Alexandr Kostochka) Electronic Journal of Combinatorics.
- Avoiding long Berge cycles II, exact bounds for all n. (with Zoltan Furedi and Alexandr Kostochka) to appear in Journal of Combinatorics.
- On r-uniform hypergraphs with circumference less than r. (with Alexandr Kostochka) Discrete Applied Mathematics.
- Avoiding long Berge cycles. (with Zoltan Furedi and Alexandr Kostochka) Journal of Combinatorial Theory.
- A variation of a theorem of Posa. (with Zoltan Furedi and Alexandr Kostochka) Discrete Mathematics.
- Stability in the Erdos--Gallai Theorem on cycles and paths, II. (with Zoltan Furedi, Alexandr Kostochka, and Jacques Verstraete) Discrete Mathematics.
- Extensions of a theorem of Erdos on nonhamiltonian graphs. (with Zoltan Furedi and Alexandr Kostochka) Journal of Graph Theory.
- The maximum number of cliques in graphs without long cycles. Journal of Combinatorial Theory, Series B.
- A stability version for a theorem of Erdos on nonhamiltonian graphs. (with Zoltan Furedi and Alexandr Kostochka) Discrete Mathematics.
- A forest building process on simple graphs.(with Zhanar Berikkyzy, Steve Butler, Jay Cummings, Kristin Heysse, Paul Horn, and Brent Moran) Discrete Mathematics.
- Signed quasi-clique merger: a new clustering method for signed networks with positive and negative edges. (with Xingqin Qi, Edgar Fuller, Rong Luo, and Cun-Quan Zhang) International Journal of Pattern Recognition and Artificial Intelligence.
Additionally, I have served as a graduate mentor for three undergraduate research projects through the
Illinois Geometry Lab: Spring 2015 -
Collaboration graphs and cluster analysis under Steve Bradlow, Spring 2016 -
Interactive Learning Tools for Linear Algebra under Cary Malkiewich and Jenya Sapir, Fall 2017 -
The Four Color Theorem: Archival Documentation and Outreach under Jeremy Tyson.