MATH Seminar

Title: Modular and Lexical Matchings in the Middle Levels Graph
Defense: Masters Thesis
Speaker: Kevin Wingfield of Emory University
Contact: Kevin Wingfield, kwingf2@emory.edu
Date: 2012-04-11 at 4:00PM
Venue: W302
Download Flyer
Abstract: Classes of explicitly defined matchings in the middle levels bipartite graph induced by the Boolean lattice are investigated. The original motivation for an investigation into the Hamiltonicity of the middle levels bipartite graph came from the conjecture of Havel. Here, we collect some known results and present some new observations that indicate that, when disjoint, the 2-factors obtained from taking the union of parts of these matchings always contain short cycles.