Tung H. Nguyen

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

Hello! I am Tung Nguyen, a fourth-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.

I have maintained the lists of problems submitted to two Barbados graph theory workshops: 2022a and 2024.

Papers

Preprints

  1. A counterexample to the coarse Menger conjecture (with Alex Scott and Paul Seymour), manuscript.
  2. Induced subgraph density. VII. The five-vertex path (with Alex Scott and Paul Seymour), preprint.
  3. Induced subgraph density. VI. Bounded VC-dimension (with Alex Scott and Paul Seymour), preprint.
  4. Induced subgraph density. V. All paths approach Erdős–Hajnal (with Alex Scott and Paul Seymour), preprint.
  5. Induced subgraph density. IV. New graphs with the Erdős–Hajnal property (with Alex Scott and Paul Seymour), preprint. [A talk by me]
  6. Induced subgraph density. III. Cycles and subdivisions (with Alex Scott and Paul Seymour), preprint.
  7. Induced subgraph density. II. Sparse and dense sets in cographs (with Jacob Fox, Alex Scott, and Paul Seymour), preprint.
  8. Induced subgraph density. I. A $\text{loglog}$ step towards Erdős–Hajnal (with Matija Bucić, Alex Scott, and Paul Seymour), preprint. [A talk by Paul]
  9. Some results and problems on tournament structure (with Alex Scott and Paul Seymour), preprint.
  10. A note on the Gyárfás–Sumner conjecture (with Alex Scott and Paul Seymour), preprint.
  11. Linear-sized minors with given edge density, preprint.
  12. Polynomial bounds for chromatic number. VIII. Excluding a path and a complete multipartite graph (with Alex Scott and Paul Seymour), J. Graph Theory, accepted.
  13. Highly connected subgraphs with large chromatic number, SIAM J. Discrete Math., accepted.

Published

  1. Clique covers of $H$-free graphs (with Alex Scott, Paul Seymour, and Stephan Thomassé), European J. Combin. 118 (2024), Paper No. 103909, 10 pp.
  2. On a problem of El-Zahar and Erdős (with Alex Scott and Paul Seymour), J. Combin. Theory Ser. B 165 (2024), 211–222. [A talk by Alex]
  3. Induced paths in graphs without anticomplete cycles (with Alex Scott and Paul Seymour), J. Combin. Theory Ser. B 164 (2024), 321–339.
  4. A further extension of Rödl's theorem, Electron. J. Combin. 30 (2023), no. 3, Paper No. 3.22, 16pp.
  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
arXiv