Increasing paths in edge-ordered graphs: the hypercube and random graphs

Jessica De Silva, Theodore Molla, Florian Pfender +2

An edge-ordering of a graph $G=(V,E)$ is a bijection $\varphi :E\to \{1,2,...,|E|\}$. Given an edge-ordering, a sequence of edges $P=e_1,e_2,...,e_k$ is an increasing path if it is a path…