84 citations · 438 across the 47 of their papers we have counts for
Showing 2012 · math.COShow all
3 papers · 2 filters
math.CO2012
-degree Turán density
Allan Lo, Klas Markström
Let be a -graph on vertices. For and an -subset of , define the degree of to be the number of -subsets~ such…
math.CO2012★ 70 cited
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…
math.CO2012
The range of thresholds for diameter 2 in random Cayley graphs
Demetres Christofides, Klas Markström
Given a group G, the model \mathcal{G}(G,p) denotes the probability space of all Cayley graphs of G where each element of the generating set is chosen independently at random with…