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
On the Interplay between Software Product Lines an
Raisonnement automatique
Tuesday 18 October 2022 - 14h15
Salle : 2013 - DIG-Moulon
Vander Alves .............................................

Combining randomized and observational data: Towar
Raisonnement automatique
Thursday 13 October 2022 - 10h30
Salle : 2011 - DIG-Moulon
Bénédicte Colnet .............................................

New Achievements of Artificial Intelligence in Mul
Raisonnement automatique
Tuesday 11 October 2022 - 14h15
Salle : 2013 - DIG-Moulon
.............................................

Definition and estimation of a variable importance
Raisonnement automatique
Thursday 22 September 2022 - 10h30
Salle : 2011 - DIG-Moulon
.............................................

Definition and estimation of a variable importance
Raisonnement automatique
Thursday 01 September 2022 - 10h30
Salle : 2011 - DIG-Moulon
Antoine Chambaz .............................................