Français Anglais
Accueil Annuaire Plan du site
Accueil > Evenements > Séminaires
Séminaire d'équipe(s) GALaC
Locating pairs of vertices on Hamiltonian cycles
Hao Li

22 January 2016, 14h30 - 22 January 2016, 16h00
Salle/Bat : 235/PCRI-S
Contact :

Activités de recherche : Théorie des graphes

Résumé :
We first introduce some of our recent results that generalises Dirac's theorem in Hamiltonian graph theory. Then we will focus on the following conjecture of Enomoto that states that, if $G$ is a graph of order $n$ with minimum degree $delta(G)geq frac{n}{2}+1$, then for any pair of vertices $x$, $y$ in $G$, there is a Hamiltonian cycle $C$ of $G$ such that $d_C(x,y)=lfloor frac{n}{2}rfloor$. Weihua He, Qiang He and I gave a proof of Enomoto's conjecture for graphs of sufficiently large order. The main tools of our proof are Regularity Lemma of Szemer'{e}di and Blow-up Lemma of Koml'{o}s et al..

Pour en savoir plus :
Séminaires
Langage d'icônes et visualisation d'ensembles : mé
Thursday 24 October 2019 - 14h30
Salle : 475 - PCRI-N
Jean-Baptiste Lamy .............................................

Matchings and related structures with Specified Co
Théorie des graphes
Thursday 17 October 2019 - 14h30
Salle : 445 - PCRI-N
Yannis Manoussakis .............................................

Conservation of structural long-range modules in R
Thursday 17 October 2019 - 14h30
Salle : 475 - PCRI-N
Vladimir Reinharz .............................................

Overcoming interference in the beeping communicati
Algorithmique distribuée
Friday 11 October 2019 - 14h30
Salle : 445 - PCRI-N
Fabien Dufoulon .............................................

Local checkability: a notion that started in the c
Algorithmique distribuée
Tuesday 08 October 2019 - 11h00
Salle : 465 - PCRI-N
Prof. Kutten Shay .............................................