Edge Constrained Eulerian Extensions

Abstract

In this paper we study Eulerian extensions with edge constraints and use the probabilistic method to establish sufficient conditions for a given connected graph to be a subgraph of a Eulerian graph containing $m$ edges, for a given number $m$.

arXiv commentAccepted for presentation in 8th International Conference on Mathematics and Computing (ICMC 2022), VIT Vellore and published in Springer Proceedings in Mathematics and Statistics