189 citations · 506 across the 54 of their papers we have counts for
5 papers · 1 filter
New Computational Upper Bounds for Ramsey Numbers R(3,k)
Jan Goedgebeur, Stanisław P. Radziszowski
Using computational techniques we derive six new upper bounds on the classical two-color Ramsey numbers: R(3,10) <= 42, R(3,11) <= 50, R(3,13) <= 68, R(3,14) <= 77, R(3,15) <= 87,…
Ramsey numbers R(K3,G) for graphs of order 10
Gunnar Brinkmann, Jan Goedgebeur, Jan-Christoph Schlage-Puchta
In this article we give the generalized triangle Ramsey numbers R(K3,G) of 12 005 158 of the 12 005 168 graphs of order 10. There are 10 graphs remaining for which we could not det…
The Generation of Fullerenes
Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay
We describe an efficient new algorithm for the generation of fullerenes. Our implementation of this algorithm is more than 3.5 times faster than the previously fastest generator fo…
Generation and Properties of Snarks
Gunnar Brinkmann, Jan Goedgebeur, Jonas Hägglund +1
For many of the unsolved problems concerning cycles and matchings in graphs it is known that it is sufficient to prove them for \emph{snarks}, the class of nontrivial 3-regular gra…
House of Graphs: a database of interesting graphs
Gunnar Brinkmann, Kris Coolsaet, Jan Goedgebeur +1
In this note we present House of Graphs (http://hog.grinvin.org) which is a new database of graphs. The key principle is to have a searchable database and offer -- next to complete…