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.

Publications and preprints

  1. A further extension of Rödl's theorem, manuscript.
  2. Linear-sized minors with given edge density, submitted.
  3. Induced paths in sparse cycle-touching graphs (with Alex Scott and Paul Seymour), manuscript.
  4. Highly connected subgraphs with large chromatic number, submitted.
  5. Growing balanced covering sets, Discrete Math. 344 (2021), no. 11, Paper No. 112554, 6pp.
  6. The average cut-rank of graphs (with Sang-il Oum), European J. Combin. 90 (2020), Paper No. 103183, 22 pp.

Google Scholar