2:30 p.m. The number of non-crossing perfect matchings compatible with a 2-coloring. Todd Kemp, Math Dept, University of California San Diego
Karl Mahlburg, Math Dept, Princeton University
Amarpreet Rattan, Department of Economics, Mathematics and Statistics, Birbeck, University of London
Clifford Smyth*, Dept of Math University of North Carolina Greensboro
(1064-05-279)
8:00 a.m. Degree Conditions for $H$-Linked Digraphs. Michael Ferrara*, University of Colorado Denver
Michael Jacobson, University of Colorado Denver
Florian Pfender, Universität Rostock, Rostock, Germany
(1064-05-150)
8:30 a.m. Each sparse graph decomposes into a forest and a graph with bounded degree. Seog-Jin Kim, Konkuk University, Seoul, South Korea
Alexandr Kostochka*, University of Illinois at Urbana-Champaign
Douglas B. West, University of Illinois at Urbana-Champaign
Hehui Wu, University of Illinois at Urbana-Champaign
Xuding Zhu, Zhejiang Normal University, Jinhua, China
(1064-05-102)