For more information about this meeting, contact Stephen Simpson, Jan Reimann.
|Title:||The logic of graph decompositions.|
|Speaker:||Stephen Flood, Pennsylvania State University|
|The theory of simplicial graph decompositions studies the infinite graphs that can be built using a sequence of irreducible graphs which are attached together at complete subgraphs. We study the logical strength required to prove the area's "existence theorems," which say that certain classes of graphs admit such a decomposition. We will discuss the strength of these existence theorems from the perspective of reverse mathematics and computability theory. In addition, we will give upper and lower bounds on the possible ordinal lengths of prime decompositions.|
Room Reservation Information
|Date:||04 / 16 / 2013|
|Time:||02:30pm - 03:45pm|