Youngho Yoo

I am an Assistant Professor of Mathematics at Florida State University. I am interested in combinatorics, graph theory, and their applications in algorithms and combinatorial optimization. My research is supported by the NSF Grant DMS-2553972.

Prior to joining FSU, I was an Assistant Professor (2025-2026) at the University of Alaska Fairbanks and a Visiting Assistant Professor (2022-2025) at Texas A&M University, where I was mentored by Chun-Hung Liu.  I obtained my PhD (2022) from the Algorithms, Combinatorics, and Optimization program at the Georgia Institute of Technology under the supervision of Xingxing Yu and Robin Thomas. I completed my Bachelor's (2015) and Master's (2017) degrees at the University of Waterloo.

Contact:

Email: yyoo2@fsu.edu

Office: LOV 117

Papers:

• Homomorphism counting from a proper immersion-closed class is not isomorphism
  with Andrea Jiménez, Benjamin Moore, and Daniel A. Quiroz.

• Tree-width of a graph excluding an apex-forest or a wheel as a minor
  with Chun-Hung Liu.

• Improved Decomposition Bounds for Partition Polytopes and Odd-Covers
  with Steffen Borgwardt, Zdeněk Dvořák, Bryce Frederickson, and Abigail Nix.

• Tight minimum degree conditions for apex-outerplanar minors and subdivisions in graphs and digraphs (arxiv)

with Chun-Hung Liu. 

Journal of Graph Theory (2026).

• Path Odd-Covers of Graphs  (arxiv)

with Steffen Borgwardt, Calum Buchanan, Eric Culver, Bryce Frederickson, and Puck Rombach.
Discrete Mathematics 349 (2026), 115078.

• Erdős-Pósa property of A-paths in unoriented group-labelled graphs (arxiv)

with O-joung Kwon. 

Combinatorica 46:9 (2026).

• A unified Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups (arxiv)

with J. Pascal Gollin, Kevin Hendrey, O-joung Kwon, and Sang-il Oum.
Mathematische Annalen 393 (2025), 2507-2559.

• Chasing Tripods to Obtain a Rooted Subdivision
  with Koyo Hayashi and Ken-ichi Kawarabayashi.
  SIAM Journal on Discrete Mathematics 39:3 (2025), 1683-1711.

• Disjoint paths problem with group-expressable constraints
  with Chun-Hung Liu.
  Proceedings of 57th Annual ACM Symposium on Theory of Computing (STOC '25), pp. 1933-1943.

• Sampling planar tanglegrams and pairs of disjoint triangulations (arxiv)
  with Alexander E. Black, Kevin Liu, Alex McDonough, Garrett Nelson, Michael C. Wigal, and Mei Yin.
  Advances in Applied Mathematics 149 (2023), 102550.

• Packing cycles in undirected group-labelled graphs (arxiv)
  with Robin Thomas.
  Journal of Combinatorial Theory, Series B 161 (2023), 228-267.

• Packing A-paths of length zero modulo a prime (arxiv)
  with Robin Thomas.
  Journal of Combinatorial Theory, Series B 160 (2023), 114-143.

• Approximating TSP walks in subcubic graphs (arxiv)
  with Michael Wigal and Xingxing Yu.
  Journal of Combinatorial Theory, Series B 158 (2023), 70-104.

• The extremal functions for triangle-free graphs with excluded minors (arxiv)
  with Robin Thomas.
  European Journal of Combinatorics 75 (2019), 1-10.

• A post-quantum digital signature scheme based on supersingular isogenies
  with Reza Azarderakhsh, Amir Jalali, David Jao, and Vladimir Soukharev.
  Financial Cryptography and Data Security, LNCS 10322 (2017), 163-181.

Teaching:

University of Alaska Fairbanks

• Spring 2026: MATH 252 Calculus 2

• Spring 2026: MATH 314 Linear Algebra

• Fall 2025: MATH 663 Graph Theory

Texas A&M University

• Spring 2025: MATH 470 Communications and Cryptography, section 503

• Fall 2024: MATH 300 Foundations of Mathematics, sections 904, 906

• Spring 2024: MATH 300 Foundations of Mathematics, section 902

• Fall 2023: MATH 470 Communications and Cryptography, sections 501, 502

• Spring 2023: MATH 470 Communications and Cryptography, section 501

• Fall 2022: MATH 251 Engineering Mathematics III, sections 501, 512

Georgia Institute of Technology

• Spring 2021: MATH 2603 Introduction to Discrete Math

• Spring 2020: MATH 2603 Introduction to Discrete Math