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
- Induced subgraph density. VI. Graphs that approach Erdős–Hajnal
(with Alex Scott and Paul Seymour),
manuscript.
- Induced subgraph density. V. All paths approach Erdős–Hajnal
(with Alex Scott and Paul Seymour),
submitted.
- Induced subgraph density. IV. New graphs with the Erdős–Hajnal property
(with Alex Scott and Paul Seymour),
submitted.
[A talk by me]
- Induced subgraph density. III. The pentagon and the bull
(with Alex Scott and Paul Seymour),
submitted.
- Induced subgraph density. II. Sparse and dense sets in cographs
(with Jacob Fox, Alex Scott, and Paul Seymour),
submitted.
- Induced subgraph density. I. A $\text{loglog}$ step towards Erdős–Hajnal
(with Matija Bucić, Alex Scott, and Paul Seymour),
submitted.
[A talk by Paul]
- Some results and problems on tournament structure
(with Alex Scott and Paul Seymour),
submitted.
- On a problem of El-Zahar and Erdős
(with Alex Scott and Paul Seymour),
submitted.
[A talk by Alex]
- Polynomial bounds for chromatic number. VIII. Excluding a path and a complete multipartite graph
(with Alex Scott and Paul Seymour),
submitted.
- A note on the Gyárfás–Sumner conjecture
(with Alex Scott and Paul Seymour),
submitted.
- Clique covers of $H$-free graphs
(with Alex Scott, Paul Seymour, and Stephan Thomassé),
submitted.
- Induced paths in graphs without anticomplete cycles
(with Alex Scott and Paul Seymour),
submitted.
- Linear-sized minors with given edge density,
submitted.
- Highly connected subgraphs with large chromatic number,
submitted.
- A further extension of Rödl's theorem,
Electron. J. Combin., accepted.
Published
- Growing balanced covering sets,
Discrete Math. 344 (2021), no. 11, Paper No. 112554, 6pp.
- The average cut-rank of graphs
(with Sang-il Oum),
European J. Combin. 90 (2020), Paper No. 103183, 22 pp.
Google Scholar
arXiv