3 problems

Let $K_{n,n}^q$ consist of every demand multigraph on the complete balanced bipartite graph $K_{n,n}$ with maximum degree at most $q$; the demand graph need not be bipartite. A dem…

Let $K_n^q$ denote the set of demand multigraphs with maximum degree at most $q$ on a complete graph on $n$ vertices. A complete graph is terminal-pairable with respect to $K_n^q$…

Let $K_{n,n}$ be the complete bipartite graph with $n$ vertices in each color class. A bipartite demand graph $D$ has vertex set $V(K_{n,n})$, and every edge of $D$ is a copy of an…