Matt DeVos

most citedMinimum degree condition forcing complete graph immersion

8 citations · 12 across the 2 of their papers we have counts for

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2013

A short proof of Kneser's addition theorem for abelian groups

Matt DeVos

Martin Kneser proved the following addition theorem for every abelian group $G$ . If $A, B \subseteq G$ are finite and nonempty, then $∣ A + B ∣ \geq ∣ A + K ∣ + ∣ B + K ∣ - ∣ K ∣$ where $K = \{g \…

math.CO2013★ 4 cited

A New Proof of Kemperman's Theorem

Tomas Boothby, Matt DeVos, Amanda Montejano

Let $G$ be an additive abelian group and let $A, B \subseteq G$ be finite and nonempty. The pair $(A, B)$ is called critical if the sumset $A+B = {a+b \mid $a \in A $an d$ b\in B$}$ s…

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 $H$ into a graph $G$ is a one-to-one mapping $f : V (H) \to V (G)$ and a collection of edge-disjoint paths in $G$ , one for each edge of $H$ , 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 $G$ of diameter $\geq 3$ , the graph $G^{3}$ has average degree $\geq 7/4 δ (G)$ . We also provide an example showing that this bound is best possib…