Graduation Year

2015

Location

Room E102, Center for Natural Sciences, Illinois Wesleyan University

Start Date

12-4-2014 10:00 AM

End Date

12-4-2014 11:00 AM

Description

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.

Share

COinS
 
Apr 12th, 10:00 AM Apr 12th, 11:00 AM

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.