### Computational Combinatorics Roundup: October

It is the end of October, so let’s start a monthly tradition of listing new papers in computational combinatorics. This list is likely not complete, so please comment or send me an email if there is a recent paper that I missed. Some of these papers are not exactly “new” but are papers I’ve discovered since the last reference list. Since I plan to do this regularly, send me an email when you see a new paper using computational methods and I will add it to the next reference list update.

G. Brinkmann, Generating Regular Directed Graphs, Discrete Mathematics 313(1), 1-7 (2013).

G. Brinkmann, J. Goedgebeur, J. Hägglund, K. Markström, Generation and properties of snarks, arXiv:1206.6690 [math.CO].

G. Brinkmann, J. Goedgebeur, J. Schlage-Puchta, Ramsey numbers $R(K_3,G)$ for graphs of order 10, arXiv:1208.0501 [math.CO].

J. Goedgebeur, S. P. Radziszowski, New Computational Upper Bounds for Ramsey Numbers $R(3, k)$, arXiv:1210.5826 [math.CO].

A. Grzesik, On the maximum number of five-cycles in a triangle-free graph, Journal of Combinatorial Theory, Series B 102, 1061-1066 (2012). Also arXiv:1102.0962 [math.CO]

S. Nieß, Counting monochromatic copies of $K_4$: a new lower bound for the Ramsey multiplicity problem, arXiv:1207.4714v1 [math.CO].