
DeVos, Matt
Friendly partitions ★★
Author(s): DeVos
A friendly partition of a graph is a partition of the vertices into two sets so that every vertex has at least as many neighbours in its own class as in the other.


Circular colouring the orthogonality graph ★★
Author(s): DeVos; Ghebleh; Goddyn; Mohar; Naserasr
Let denote the graph with vertex set consisting of all lines through the origin in
and two vertices adjacent in
if they are perpendicular.

Keywords: circular coloring; geometric graph; orthogonality
5-local-tensions ★★
Author(s): DeVos



Gao's theorem for nonabelian groups ★★
Author(s): DeVos
For every finite multiplicative group , let
(
) denote the smallest integer
so that every sequence of
elements of
has a subsequence of length
(length
) which has product equal to 1 in some order.


Keywords: subsequence sum; zero sum
Antichains in the cycle continuous order ★★
Author(s): DeVos
If ,
are graphs, a function
is called cycle-continuous if the pre-image of every element of the (binary) cycle space of
is a member of the cycle space of
.




Drawing disconnected graphs on surfaces ★★
Author(s): DeVos; Mohar; Samal








Keywords: crossing number; surface
What is the largest graph of positive curvature? ★
Keywords: curvature; planar graph
Partitioning edge-connectivity ★★
Author(s): DeVos








Keywords: edge-coloring; edge-connectivity
Packing T-joins ★★
Author(s): DeVos






A homomorphism problem for flows ★★
Author(s): DeVos







Keywords: homomorphism; nowhere-zero flow; tension
