ORCID iD iconorcid.org/0000-0002-2617-5189

Selected Publications

Sharpening an Ore-type version of the Corrádi-Hajnal Theorem
Henry Kierstead, Alexandr Kostochka, Theodore Molla, Y.
Abh. Math. Semin. Univ. Hambg. (2016).

A refinement of theorems on vertex-disjoint chorded cycles
Theodore Molla, Michael Santana, Y.
Graphs and Combinatorics (2016). doi:10.1007/s00373-016-1749-0

On the Corrádi-Hajnal theorem and a question of Dirac
Henry Kierstead, Alexandr Kostochka, Y.
Journal of Combinatorial Theory, Series B 122C (2017) pp. 121-148
DOI: 10.1016/j.jctb.2016.05.007

Thesis: Extremal problems in disjoint cycles and graph saturation

Graphs with induced-saturation number zero
Sarah Behrens, Catherine Erbes, Michael Santana, Derrek Yager, Y.
Electronic Journal of Combinatorics, 2016

The (2k-1)-connected multigraphs with at most k-1 disjoint cycles
Henry Kierstead, Alexandr Kostochka, Y.
Combinatorica, July 2015

Large posets of small dimension
Benjamin Reiniger, Y.
Order. May 2015

Ramsey-minimal saturation numbers for matchings
Michael Ferrara, Jaehoon Kim, Y.
Discrete Math. 322(2014), 26-30

A note on list-coloring powers of graphs
Nicholas Kosar, Sarka Petrickova, Benjamin Reiniger, Y.
Discrete Math. 322(2014), 10-14

Induced Saturation