Relatore:	Tudor Zamfirescu (Institut für Algebra und Geometrie, Fachbereich Mathematik, Universität Dortmund, Germany)
Titolo:	Intersecting longest cycles and paths
Sunto:	In Petersen's graph the intersection of all longest cycles is void. Gallai asked in the 60th whether similar graphs for paths instead of cycles do exist. (At that time hypotraceable graphs were unknown.) Soon examples appeared. Then questions about increased connectivity, planarity etc. complicated the problem. Now, if all longest cycles or paths may have void intersection, how few of them can still have void intersection? Such are the problems discussed in my talk.
Luogo:	Aula Seminari, III piano del Dipartimento di Matematica "Francesco Brioschi", Politecnico di Milano, via Bonardi n. 9 (edificio "La Nave")
Data:	Venerdì 10 Dicembre 2004
Ore:	10:30