This award provides support for a three-day conference on Combinatorics, Graph Theory and Computing, to be held during May 23-25, 2013, at the Middle Tennessee State University. The conference will feature invited talks as well as contributed talks on a wide range of topics from graph theory and combinatorics.
This conference is the twenty-sixth in the series ``Cumberland Conference on Combinatorics, Graph Theory and Computing", which was begun with the intention of meeting a regional need. The conferences bring together internationally known researchers, university and college professors from throughout the southeastern region, some industrial mathematicians and computer scientists, graduate students in these fields, and some undergraduate students. Particular efforts are made to include faculty and students from smaller institutions throughout the region.
The Twenty-Sixth Cumberland Conference on Combinatorics, Graph Theory and Computing was held at Middle Tennessee State University in Murfreesboro, TN from May 24 to May 26, 2013. The conference was sponsored by the National Science Foundation and by Middle Tennessee State University. The conference attracted over 100 researchers, including 32 women, 30 students and 25 Junior faculty. One goal of the conference was so that geographically distant researchers might gather together in order to share research results in theoretical and applied discrete mathematics and in computer science. Another goal was so that researchers in discrete mathematics might collaboratively explore further research directions in an energetic and safe intellectual atmosphere. The conference was held in a location central to many researchers in the mid-South region of the United States. To help stimulate ideas among the regional attendees, many well-known national and international researchers were also invited. The conference featured four plenary speakers: Paul Balister, Agelos Georgakopoulos, Neil Robertson and Cun-Quan Zhang. The conference also featured 50 contributed talks in the areas of combinatorics, graph theory, theoretical discrete mathematics, applied discrete mathematics, algorithms, and computer science. The talks were conveniently scheduled in two parallel sessions. The four plenary speakers and additional 24 participants were supported by this National Science Foundation grant. Supportees included 11 women, 12 graduate students, 1 undergraduate student, and 8 junior faculty. The conference website will be available at http:mtweb.mtsu.edu/cc2013
