Man

Hiep Han

Profesor

UNIVERSIDAD DE SANTIAGO DE CHILE

Santiago, Chile

Líneas de Investigación


Discrete Mathematics; Extremal Combinatorics; Algorithms and complexity; Discrete Probability

Educación

  •  Computer Science, HUMBOLDT-UNIVERSITÄT ZU BERLIN. Alemania, 2010
  •  Computer Science, HUMBOLDT UNIVERSITAT ZU BERLIN. Alemania, 2006

Experiencia Académica

  •   Postdoc Full Time

    UNIVERSIDAD DE CHILE

    Chile

    2015 - 2016

  •   Profesor Full Time

    UNIVERSIDAD DE SANTIAGO DE CHILE

    Chile

    2017 - A la fecha

  •   Associated Researcher Full Time

    PONTIFICIA UNIVERSIDAD CATOLICA DE VALPARAISO

    Chile

    2016 - 2017

  •   Postdoc Full Time

    UNIVERSITAT HAMBURG

    Atlanta, Alemania

    2010 - 2011

  •   Postdoc Full Time

    UNIVERSIDADE DE SAO PAULO

    Brasil

    2011 - 2015

  •   Postdoc Full Time

    EMORY UNIVERSITY

    Estados Unidos

    2013 - 2015

Experiencia Profesional

  •   Grupo de Estudio Fondecyt Other

    ANID

    Chile

    2020 - A la fecha

Formación de Capital Humano


Doctoral student: Matias Pavez-Signe, 2017-2021
Undergraduate: Gonzalo Toro, 2020-


Difusión y Transferencia


Invited lectures, mini-courses and workshops (selected)
* Sub-plenary talk at the Somachi 2017, Talca
* Mini-course "Quasi-random graphs and regularity", III Escuela Latinamericana en Algoritmos, EPN, Quito
* Invited speaker at SIAM Conference on Discrete Mathematics, Minneapolis, 2014
* Invited speaker at Atlanta Lecture Series, 2014
* Participant of the "Ergodic Theory and Combinatorial Number Theory" workshop, Oberwolfach, 2012
* Participant of the long program "Combinatorics: Methods and Applications in Mathematics and Computer Science", IPAM, UCLA, 2009



 

Article (19)

Ramsey numbers involving graphs and hypergraphs with large girth
Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs
Linear quasi-randomness of subsets of abelian groups and hypergraphs
Almost partitioning 2-colored complete 3-uniform hypergraphs into two monochromatic tight or loose cycles
IMPROVED BOUND ON THE MAXIMUM NUMBER OF CLIQUE-FREE COLORINGS WITH TWO AND THREE COLORS
Maximum number of sum-free colorings in finite abelian groups
Quasirandomness for hypergraphs
VERTEX FOLKMAN NUMBERS AND THE MINIMUM DEGREE OF MINIMAL RAMSEY GRAPHS
Erdos-Ko-Rado for Random Hypergraphs: Asymptotics and Stability
POWERS OF HAMILTON CYCLES IN PSEUDORANDOM GRAPHS
Quasirandomness in hypergraphs
A sharp threshold for van der Waerden's theorem in random subsets
Polynomial configurations in subsets of random and pseudo-random sets
Extremal results for odd cycles in sparse pseudorandom graphs
Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs
Weak quasi-randomness for uniform hypergraphs
Dirac-type results for loose Hamilton cycles in uniform hypergraphs
Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions
On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree

Proyecto (9)

Extremal Combinatorics, Random Discrete Structures and the Container Method
Núcleo Milenio Información y Coordinación en Redes
Quasi-randomness and extremal combinatorics
Núcleo Milenio Información y Coordinación en Redes
Sparse random structures
Combinatorial structures, optimization and algorithms in Computer Sciences.
Degenerate extremal problems for random discrete structures
Solving combinatorial problems using optimization techniques.
Quasi-random hypergraphs and spanning subhypergraph containment
19
Hiep Han

Profesor

Departamento de Matemática y Ciencia de la Computación

UNIVERSIDAD DE SANTIAGO DE CHILE

Santiago, Chile

3
Andrea Jimenez

Assistant Professor

Universidad de Valparaíso

Valparaíso, Chile

1
Maya Stein

Full Professor

Department of Mathematical Engineering

Universidad de Chile

Santiago, Chile