Ringel's decomposition problem and graph labellings

Simple item page
dc.contributor.authorRosa, Alexander
dc.date.accessioned2017-05-18T19:13:14Z
dc.date.available2017-05-18T19:13:14Z
dc.date.copyright2017en_US
dc.date.issued2017-05-18
dc.description.abstractDuring the 1963 international graph theory conference in Smolenice, Czechoslovakia, Gerhard Ringel formulated the following conjecture: The complete graph with vertices can be decomposed into subgraphs, each isomorphic to a given tree with edges. Shortly thereafter, several kinds of graph labellings were introduced with the aim of attacking Ringel’s conjecture. Among these, the graceful labelling (originally called labelling) became the most prominent. Professor Alexander Rosa will attempt to present an overview of the up-to-date approaches to Ringel’s conjecture, and also to the well-known conjecture that every tree has a graceful labelling.en_US
dc.description.reviewstatusRevieweden_US
dc.description.scholarlevelFaculty
dc.description.sponsorshipLansdowne Lecture Series
dc.description.sponsorshipDepartment of Mathematics and Statistics
dc.identifier.urihttp://hdl.handle.net/1828/8138
dc.language.isoenen_US
dc.subjectGraph theory
dc.subjectMathematics
dc.subjectLansdowne Lectures
dc.subject.departmentDepartment of Mathematics and Statistics
dc.titleRingel's decomposition problem and graph labellings
dc.typeVideoen_US

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
rosa_alexander_lansdowne_2017.mp4
Size:
344.97 MB
Format:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.74 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Lansdowne Lectures
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.