2 problems

For $k\in\mathbb{N}$, let $Q_{2k+1}$ denote the $(2k+1)$-dimensional hypercube. A graph is path-pairable if every pairing of its vertices can be joined by pairwise edge-disjoint pa…

Cartesian-product conjecture. There exist non-path-pairable graphs $G$ and $H$ such that