BEGIN:VCALENDAR
VERSION:2.0
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
BEGIN:VEVENT
CATEGORIES:Lectures & Presentations
DESCRIPTION:Graph Theory and the Barnette Conjecture\n\nJohn Key and Theres
e Relucio\n\nDavid W. Barnette conjectured that the vertices of certain pla
nar graphs can be traversed in a cycle along their edges. 50 years later an
d the conjecture is still unproven. Continuing off of last summer’s student
s’ research\, we coded the conjecture as a SAT solution so that a solver co
uld find a cycle on 1000 vertices in under 10 seconds. We then considered t
he graph of all disjoint cycle coverings of Barnette’s planar graphs and st
udied its structure. We finished the summer by writing algorithms that were
designed to find such a cycle in the graph\, which if proven to work witho
ut error\, would prove the conjecture. Further research includes refining t
he algorithms and proving their steps.
DTEND:20200918T213000Z
DTSTAMP:20201024T092717Z
DTSTART:20200918T203000Z
LOCATION:
SEQUENCE:0
SUMMARY:Come Hear CS Students talk about their Internship and Research!
UID:tag:localist.com\,2008:EventInstance_34591374596320
URL:https://calendar.udallas.edu/event/come_hear_cs_students_talk_about_the
ir_internship_and_research
END:VEVENT
END:VCALENDAR