Loading…
Back To Schedule
Sunday, January 23 • 10:15am - 10:30am
Session 3C - On the Girth of Assignment Graphs Generated from Digraphs

Sign up or log in to save this to your schedule, view media, leave feedback and see who's attending!

Tweet Share
Feedback form is now closed.
Open Zoom

Graph pebbling is a mathematical game played on a graph G with no loops or multiple edges. A standard pebbling move consists of removing two pebbles from a vertex and adding one pebble to an adjacent vertex. An assignment graph is a Hasse diagram derived from each sequence of possible pebbling moves. In this presentation, we focus on digraphs G with no bidirectional edges. We investigate assignment graphs and analyze what properties yield certain girths.
Speakers
avatar for Xufei Liu

Xufei Liu

Undergraduate Presenter, Georgia Institute of Technology
I am an undergraduate student studying industrial engineering and operations research. Over the summer I participated in the Moravian Computational Mathematics REU and worked on projects relating to number theory and graph theory.

Group 5 Assignment Graphs (14) pdf
Sunday January 23, 2022 10:15am - 10:30am CST
Zoom
  Zoom Meeting Room C, Undergraduate Talk

Attendees (11)