Bienvenidos(as) al DMCC | Departamento de Matemática y Ciencia de la Computación

Hiep Han

Hiep Han

Publicaciones recientes:

  1. Hiep Han, Andrea Jiménez. IMPROVED BOUND ON THE MAXIMUM NUMBER OF CLIQUE-FREE COLORINGS WITH TWO AND THREE COLORS. 2018 SIAM JOURNAL ON DISCRETE MATHEMATICS
  2. Hiep Han, Andrea Jiménez. IMPROVED BOUND ON THE MAXIMUM NUMBER OF CLIQUE-FREE COLORINGS WITH TWO AND THREE COLORS. 2018 SIAM JOURNAL ON DISCRETE MATHEMATICS
  3. Elad Aigner-Horev, David Conlon, Hiep Han, Yury Person, Mathias Schacht. Quasirandomness In Hypergraphs. 2018 ELECTRONIC JOURNAL OF COMBINATORICS
  4. Hiệp Hàn, Vojtěch Rödl, Tibor Szabó. Vertex Folkman Numbers And The Minimum Degree Of Minimal Ramsey Graphs. 2018 SIAM JOURNAL ON DISCRETE MATHEMATICS
  5. Sebastián Bustamante, Hiêp Hàn, Maya Stein. Almost Partitioning 2-Colored Complete 3-Uniform Hypergraphs Into Two Monochromatic Tight Or Loose Cycles. 2019 JOURNAL OF GRAPH THEORY
  6. Elad Aigner-Horev, Hiệp Hàn. Linear Quasi-Randomness Of Subsets Of Abelian Groups And Hypergraphs. 2020 EUROPEAN JOURNAL OF COMBINATORICS
  7. Hiep Han, Jie Han, Patrick Morris. Factors And Loose Hamilton Cycles In Sparse Pseudo-Random Hypergraphs. 2020 PROCEEDINGS OF THE ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS
  8. Han Hiep, Marcos Kiwi, Matías Pavez-Signé. Quasi-Random Words And Limits Of Word Sequences. 2020 LECTURE NOTES IN COMPUTER SCIENCE
  9. Han Hiep, Marcos Kiwi, Matías Pavez-Signé. Quasi-Random Words And Limits Of Word Sequences. 2021 EUROPEAN JOURNAL OF COMBINATORICS
  10. Hiêp Hàn, Troy Retter, Vojtêch Rödl, Mathias Schacht. Ramsey-Type Numbers Involving Graphs And Hypergraphs With Large Girth. 2021 COMBINATORICS PROBABILITY & COMPUTING
  11. Hiệp Hàn, Jie Han, Patrick Morris. Factors And Loose Hamilton Cycles In Sparse Pseudo-Random Hypergraphs. 2022 RANDOM STRUCTURES & ALGORITHMS
  12. Hiệp Hàn, Jie Han, Yi Zhao . P Minimum Degree Thresholds For Hamilton (K/2)-Cycles In K-Uniform Hypergraphs. 2022 JOURNAL OF COMBINATORIAL THEORY SERIES B
Subir