AMS Sectional Meeting AMS Special Session
Current as of Saturday, November 19, 2016 03:30:05
Special Event or Lecture · Inquiries: meet@ams.org
Fall Southeastern Sectional Meeting
North Carolina State University, Raleigh, NC
November 12-13, 2016 (Saturday - Sunday)
Meeting #1124
Associate secretaries:
Brian D Boe, AMS brian@math.uga.edu
Special Session on Structural and Computational Graph Theory
-
Saturday November 12, 2016, 8:00 a.m.-10:50 a.m.
Special Session on Structural and Computational Graph Theory, I
Room 1220, SAS Hall
Organizers:
Stephen Harte, University of Colorado Denver
Bernard Lidický, Iowa State University lidicky@iastate.edu
-
8:00 a.m.
Online coloring blowups of a known graph.
Kevin G Milans*, West Virginia University
Michael Wigal, West Virginia University
(1124-05-403) -
8:30 a.m.
Choosability with Union Separation.
Mohit Kumbhat, Iowa State University
Kevin Moss*, Iowa State University
Derrick Stolee, Iowa State University
(1124-05-375) -
9:00 a.m.
Precoloring Extension for Distinguishing Colorings.
Michael Ferrara, University of Colorado Denver
Ellen Gethner, University of Colorado Denver
Stephen Hartke, University of Colorado Denver
Derrick Stolee, Microsoft
Paul S Wenger*, Rochester Institute of Technology
(1124-05-378) -
9:30 a.m.
Minimum weight eulerian circuits.
James M Carraher*, University of Nebraska at Kearney
(1124-05-294) -
10:00 a.m.
Triangle-tilings in graphs without large independent sets.
Jozsef Balogh, University of Illinois at Urbana-Champaign
Andrew McDowell, University of Birmingham
Theodore Molla*, University of Illinois at Urbana-Champaign
Richard Mycroft, University of Birmingham
(1124-05-351) -
10:30 a.m.
Extremal problems for clique counts.
Jon Cutler, Montclair State University
Jamie Radcliffe*, University of Nebraska-Lincoln
(1124-05-321)
-
8:00 a.m.
-
Saturday November 12, 2016, 3:00 p.m.-4:50 p.m.
Special Session on Structural and Computational Graph Theory, II
Room 1220, SAS Hall
-
3:00 p.m.
Automated Discharging Arguments for Density Problems in Grids.
Derrick Stolee*, Raleigh, NC
(1124-05-44) -
3:30 p.m.
Automated conjecturing for proof discovery.
Craig Larson*, Virginia Commonwealth University
(1124-05-219) -
4:00 p.m.
Ramsey numbers on the Boolean lattice.
Christopher Cox*, Carnegie Mellon University
Derrick Stolee, Microsoft
(1124-05-317) -
4:30 p.m.
Doubly Threshold Graphs.
Sadegh Bolouki, University of Illinois at Urbana-Champaign
Olgica Milenkovic, University of Illinois at Urbana-Champaign
Gregory J. Puleo*, Auburn University
Vida Ravanmehr, University of Illinois at Urbana-Champaign
(1124-05-312)
-
3:00 p.m.
-
Sunday November 13, 2016, 8:00 a.m.-10:50 a.m.
Special Session on Structural and Computational Graph Theory, III
Room 1220, SAS Hall
-
8:00 a.m.
Star decompositions of random regular graphs.
Bernard Lidický, Iowa State University
Michelle Delcourt*, University of Illinois at Urbana-Champaign
Luke Postle, University of Waterloo
(1124-05-215) -
8:30 a.m.
$I,F$-partitions of sparse graphs.
Axel Brandt*, Davidson College
Michael Ferrara, University of Colorado Denver
Mohit Kumbhat, Iowa State University
Sarah Loeb, University of Illinois at Urbana-Chamaign
Derrick Stolee, Microsoft
Matthew Yancey, Institute for Defense Analyses / Center for Computing Sciences
(1124-05-193) -
9:00 a.m.
Bounded Diameter Arboricity.
Martin Merker, Hamburg University
Luke Postle*, University of Waterloo
(1124-05-258) -
9:30 a.m.
A unique current-best algorithm to find a distance-approximating tree.
Matthew Yancey*, Institute of Defense Analyses / Center for Computing Sciences
(1124-05-102) -
10:00 a.m.
Forest building process.
Steve Butler*, Iowa State University
(1124-05-75) -
10:30 a.m.
Ore and Chvátal-type Degree Conditions for Fast Bootstrap Percolation.
Michael Dairyko, Iowa State University
Michael Ferrara*, University of Colorado Denver
Bernard Lidicky, Iowa State University
Ryan M. Martin, Iowa State University
Florian Pfender, University of Colorado Denver
Andrew Uzzell, University of Nebraska - Lincoln
(1124-05-338)
-
8:00 a.m.
Inquiries: meet@ams.org