2 problems

For a positive integer $t$, let $K_t\square K_t\square K_t$ be the Cartesian product of three complete graphs on $t$ vertices. A graph is path-pairable if every pairing of its vert…

Let $t$ be a positive integer and let $q$ be an upper bound on the maximum degree of the demand graph in the relevant complete-grid path-pairing problem. Faudree–Gyárfás–Lehel dema…