I received my Ph.D. from The Ohio State University in December 2012. My dissertation “Some topics concerning graphs, signed graphs, and matroids” was supervised by Prof. Neil Robertson. (I was his last (22) Ph.D. student.)
Research Interests: Graph Theory, Signed Graphs, Matroid Theory
Particular topics of interest include well-quasi-ordering, graph invariants (particularly chromatic number, Hadwiger number, girth), minor-closed classes of graphs, induced subgraphs, signed graphs, matroids coming from graphs, signed-graphic matroids, and statistical properties of matroids.
1. Two short proofs of the bounded case of S. B. Rao's degree sequence conjecture, Discrete Math. 313 (2013), no. 13, 1500-1501.
2. Bicircular signed-graphic matroids, Discrete Math. 328 (2014), 1–4.
3. A unified proof of Brooks’ theorem and Catlin’s theorem, Discrete Math. 338 (2015) no. 2, 272–273.
4. (with John Maharry, Neil Robertson, and Daniel Slilaty) Flexibility of projective-planar embeddings, J. Combin. Theory Ser. B 122 (2017), 241–300.
5. Some problems on induced subgraphs, Discrete Applied Mathematics, 236 (2018) 422-427.
6. (with Maria Chudnovsky) Odd holes in bull-free graphs, SIAM J. Discrete Math. 32 (2018), no. 2, 951–955.
7. (with Richard Behr, Thomas Zaslavsky) Mock threshold graphs, Discrete Math. 341 (2018) 2159–2178.
8. (with Maria Chudnovsky) Perfect divisibility and 2-divisibility, to appear in J. Graph Theory.
9. (with Bart Litjens, Sven Polak) Sum-perfect graphs, submitted.
10. (with Katie Cameron, Shenwei Huang, Irena Penev) The class of $(P_7, C_4, C_5)$-free graphs: decomposition, chi-boundedness, algorithms, submitted.
11. (with Daniel Slilaty) The graphs that have antivoltages using groups of small order, submitted.
Current projects include understanding some hereditary classes of graphs, coloring perfect graphs, chi-boundedness, line graphs of directed graphs, antivoltages in graphs, and the ubiquitous Tutte polynomial.
1. Pseudo-line graphs.
2. (with Maria Chudnovsky, Jenny Kaufmann) (P_5, fork)-free graphs are perfectly divisible.
3. (with Sang-il Oum) Structure of graphs not containing the 5-vertex path as a vertex-minor.
4. (with Bart Litjens, Sven Polak, Bart Sevenster) A characterization of graphs with Dilworth number at most 3.
5. (with Ravindra Bapat, Richard Behr, and Thomas Zaslavsky) Smock (special mock threshold) graphs.
6. (with Thomas Zaslavsky) The seven signed Heawood graphs.
1. Neil Robertson https://math.osu.edu/people/robertson.7
2. John Maharry https://u.osu.edu/maharry.1/
3. Daniel Slilaty http://www.wright.edu/~daniel.slilaty/
4. Maria Chudnovsky https://web.math.princeton.edu/~mchudnov/
5. Thomas Zaslavsky https://www2.math.binghamton.edu/p/people/zaslav/start
6. Richard Behr https://www2.math.binghamton.edu/p/people/grads/behr/start
7. Bart Litjens https://sites.google.com/site/bmlitjens/home
8. Sven Polak https://sites.google.com/site/svenpolak/
9. Kathie Cameron https://www.wlu.ca/academics/faculties/faculty-of-science/faculty-profiles/kathie-cameron/index.html
10. Shenwei Huang https://www.researchgate.net/profile/Shenwei_Huang2
11. Irena Penev https://engineering.leeds.ac.uk/staff/873/Dr_Irena_Penev
12. Lex Schrijver https://homepages.cwi.nl/~lex/
13. Bart Sevenster https://sites.google.com/site/websitebartsevenster/