Edge Constrained Eulerian Extensions
Ghurumuruhan Ganesan
TL;DR
This paper investigates conditions under which a connected graph can be embedded into a larger Eulerian graph with a specified number of edges, using probabilistic methods to derive sufficient criteria.
Contribution
It introduces new probabilistic techniques to determine when a connected graph can be extended to an Eulerian graph with edge constraints.
Findings
Established probabilistic sufficient conditions for Eulerian extensions
Derived bounds on the number of edges for such extensions
Provided theoretical framework for edge-constrained Eulerian embeddings
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 edges, for a given number .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis · Markov Chains and Monte Carlo Methods