214 citations · 235 across the 6 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2011★ 1 cited
Expanders Are Universal for the Class of All Spanning Trees
Daniel Johannsen, Michael Krivelevich, Wojciech Samotij
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H in F is contained in G as a subgraph. The construction of sparse universal graphs fo…
math.CO2008★ 2 cited
Counting Defective Parking Functions
Peter J. Cameron, Daniel Johannsen, Thomas Prellberg +1
Suppose that drivers each choose a preferred parking space in a linear car park with spaces. Each driver goes to the chosen space and parks there if it is free, and otherwi…