Submission Type
Event
Expected Graduation Date
2015
Location
Room E102, Center for Natural Sciences, Illinois Wesleyan University
Start Date
4-12-2014 10:00 AM
End Date
4-12-2014 11:00 AM
Disciplines
Applied Mathematics
Abstract
Graph labeling has been an active area of research since 1967, when Rosa introduced the concept. Arguably, the biggest open conjecture in the field is referred to as the Ringel-Kotzig conjecture, which states that all trees admit a graceful labeling. In this talk, we will give a bit of background on the problem, as well as present our own results. Namely, that a certain infinite class of trees (called uniform k-distant trees) admits a graceful labeling.
Included in
In Pursuit of the Ringel-Kotzig Conjecture: Uniform K-Distant Trees are Graceful
Room E102, Center for Natural Sciences, Illinois Wesleyan University
Graph labeling has been an active area of research since 1967, when Rosa introduced the concept. Arguably, the biggest open conjecture in the field is referred to as the Ringel-Kotzig conjecture, which states that all trees admit a graceful labeling. In this talk, we will give a bit of background on the problem, as well as present our own results. Namely, that a certain infinite class of trees (called uniform k-distant trees) admits a graceful labeling.