Spanning Structures in Multipartite Graph Traversals

[2608.15005] Spanning Structures in Multipartite Graph Traversals Skip to main content Search Submit Donate Log in Search arXiv Press Enter to search · Advanced search Mathematics > Combinatorics arXiv:2608.15005 (math) [Submitted on 15 Aug 2026] Title: Spanning Structures in Multipartite Graph Traversals Authors: Isabel McGuigan View a PDF of the paper titled Spanning Structures in Multipartite Graph Traversals, by Isabel McGuigan View PDF HTML (experimental) Abstract: Let $G$ be an $r$-partite graph such that the edge density between any two parts is at least $\alpha$. We consider the problem of determining how large $\alpha$ must be in order to guarantee that $G$ has a Hamiltonian traversal (an $r$-cycle subgraph containing exactly one vertex from each part), and show that this critical density tends to $\frac 1 2$ as $r$ increases. This resolves a conjecture of Badakhshian, Falgas-Ravry, and Sharifzadeh. We also study the critical densities necessary to guarantee the existence of other spanning structures in traversals, particularly subgraph factors, and obtain asymptotically the critical densities for traversal $F$-factor subgraphs for several classes of graphs $F$. The proofs of our results involve the absorption method. Comments: 27 pages, 2 figures Subjects: Combinatorics (math.CO) Cite as: arXiv:2608.15005 [math.CO] (or arXiv:2608.15005v1 [math.CO] for this version) https://doi.org/10.48550/arXiv.2608.15005 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Isabel McGuigan [ view email ] [v1] Sat, 15 Aug 2026 03:23:19 UTC (37 KB) Full-text links: Access Paper: View a PDF of the paper titled Spanning Structures in Multipartite Graph Traversals, by Isabel McGuigan View PDF HTML (experimental) TeX Source view license Current browse context: math.CO < prev | next > new | recent | 2026-08 Change to browse by: math References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) scite.ai Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle Gotit.pub ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle TXYZ.AI ( What is TXYZ.AI? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs . Which authors of this paper are endorsers? | Disable MathJax ( What is MathJax? ) We gratefully acknowledge support from our major funders , member institutions , , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab) Major funding support from

Related documents

• Spanning Structures in Multipartite Graph Traversals#612439
• AutoGraphForge: Towards Automated Graph Theory Discovery#926397
• Hardness and Approximation Algorithms for Balanced Districting Problems#1011993
• An Arboricity-Sensitive Algorithm for the $K_r-e$-Free Graph Sandwich Problem#1049199
• Faster Fixed-Point Methods for Multichain MDPs#158740