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 a link to the problems submitted to the second 2022 Barbados graph theory workshop, maintained by myself.

Papers

Preprints

1. Some results and conjectures in structural tournament theory (with 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. On a problem of El-Zahar and Erdős (with Alex Scott and Paul Seymour), submitted.
4. Polynomial bounds for chromatic number. VIII. Excluding a path and a complete multipartite graph (with Alex Scott and Paul Seymour), submitted.
5. A note on the Gyárfás–Sumner conjecture (with Alex Scott and Paul Seymour), submitted.
6. A $\text{loglog}$ step towards Erdős–Hajnal (with Matija Bucić, Alex Scott, and Paul Seymour), submitted. [A talk by Paul]
7. Clique covers of $H$-free graphs (with Alex Scott, Paul Seymour, and Stephan Thomassé), submitted.
8. Induced paths in graphs without anticomplete cycles (with Alex Scott and Paul Seymour), submitted.
9. A further extension of Rödl's theorem, submitted.
10. Linear-sized minors with given edge density, submitted.
11. Highly connected subgraphs with large chromatic number, submitted.

Published

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.