Thursday, July 9

MS68
Graph Theory and Related Topics - Part II of II

4:00 PM - 6:00 PM
Room: 702

For Part I, see MS54

Graphs are fundamental for study and application in discrete mathematics, due to their flexibility in modeling binary relations. This minisymposium will consider structural, extremal, and algorithmic questions about graphs and hypergraphs in various classes. The talks in the first session consider reconstruction and various coloring problems; the second session leans more toward random structures and applications. This minisymposium is supported by NSF through grant CCF-0843426.

Organizer: Douglas B. West
University of Illinois, Urbana

4:00-4:25 A Special Decomposition of Planar Graphs with Large Girth

Daniel Kleitman, Massachusetts Institute of Technology

4:30-4:55 Vertex, Edge, and Vertex-edge Random Graphs

Elizabeth Beer and James Fill, Johns Hopkins University; Svante Janson, Uppsala University, Sweden; Edward Scheinerman, Johns Hopkins University

5:00-5:25 Generalized Balloons and the Chinese Postman Problem in Regular Graphs

Suil O and Douglas B. West, University of Illinois, Urbana

5:30-5:55 Acquisition Parameters in Graphs

Paul Wenger, University of Illinois, Urbana; Noah Prince, Illinois Mathematics and Science Academy