Tung H. Nguyen

Email: tunghn [at] math.princeton.edu
Office: 218 Fine Hall, Washington Road, Princeton, NJ 08544

Hello! I am Tung Nguyen, a third-year PhD student in the Program in Applied and Computational Mathematics at Princeton University, working with Paul Seymour. Before Princeton, I earned a Bachelor of Science (with Honors) in Mathematical Sciences from KAIST, where my thesis advisor was Sang-il Oum.

My Vietnamese name is Nguyễn Huy Tùng.

I am interested in discrete mathematics, mostly structural and extremal problems in graph theory.

Here is the link to the problems so far submitted to the second 2022 Barbados graph theory workshop, maintained by myself.



  1. Towards Erdős–Hajnal (with Matija Bucić, Alex Scott, and Paul Seymour), manuscript.
  2. Towards a polynomial form of Rödl's theorem (with Jacob Fox, Alex Scott, and Paul Seymour), manuscript.
  3. Clique covers of $H$-free graphs (with Alex Scott, Paul Seymour, and Stephan Thomassé), submitted.
  4. Induced paths in sparse cycle-touching graphs (with Alex Scott and Paul Seymour), submitted.
  5. A further extension of Rödl's theorem, submitted.
  6. Linear-sized minors with given edge density, submitted.
  7. Highly connected subgraphs with large chromatic number, submitted.

Published papers

  1. Growing balanced covering sets, Discrete Math. 344 (2021), no. 11, Paper No. 112554, 6pp.
  2. The average cut-rank of graphs (with Sang-il Oum), European J. Combin. 90 (2020), Paper No. 103183, 22 pp.

Google Scholar