DIMACS - Graduate Student Combinatorics Seminar

Title: Graphons and Finite Forcibility

Speaker: Matt Charnley, Rutgers University

Date: Wednesday, March 2, 2016 12:10pm

Location: Graduate Student Lounge, 7th Floor, Hill Center, Rutgers University, Busch Campus, Piscataway, NJ


There is a somewhat clear way to define a distance between two graphs with the same number of vertices. After a slight generalization, we get a distance function that even works for graphs on differing numbers of vertices. We can also consider a sequence G_n of graphs, talk about convergence of a sequence of graphs (generally with the number of vertices going to infinity), and discuss what we mean by a limit. In this talk, I will motivate and define these limit objects, graphons, and talk about in what sense we can say the sequence converges. If time permits, I will also discuss the property of Finite Forcibility, and state a few results in this area.

See: http://math.rutgers.edu/~klm296/GCS/index.html