8 citations · 12 across the 2 of their papers we have counts for
2 papers
math.CO2011★ 8 cited
Minimum degree condition forcing complete graph immersion
Matt DeVos, Zdeněk Dvořák, Jacob Fox +3
An immersion of a graph into a graph is a one-to-one mapping and a collection of edge-disjoint paths in , one for each edge of , such that the path…
math.CO2010★ 4 cited
Edge Growth in Graph Cubes
Matt DeVos, Stéphan Thomassé
We show that for every connected graph of diameter , the graph has average degree . We also provide an example showing that this bound is best possib…