11 Mars - 17 Mars


Retour à la vue des calendrier
Jeudi 14 Mars
Heure: 10:30 - 11:30
Lieu: Salle B107, bâtiment B, Université de Villetaneuse
Résumé: Covering some vertices with paths and a Hamiltonian degree condition for tough graphs
Description: Cléophée Robin A graph G is Hamiltonian if it exists a cycle in G containing all vertices of G exactly once. A graph G is t-tough if, for all subsets of vertices S, the number of connected components in G ? S is at most |S| / t.
In 1973, Chvàtal conjecture the following : There exists a constant t such that every t-tough graphs is Hamiltonian.
Let t be a positive integer. A graph G with degree sequence d_1,d_2,...,d_n is P(t) (t being a positive integer) If for all i, t ? i