Odd Yao-Yao Graphs are Not Spanners
Yifei Jin, Jian Li, Wei Zhan

TL;DR
This paper proves that odd Yao-Yao graphs do not always function as spanners, resolving a long-standing open problem by providing counterexamples for all odd cases.
Contribution
It demonstrates that for every integer k ≥ 1, there exist odd Yao-Yao graphs that are not spanners, filling a major gap in the understanding of these graphs.
Findings
Odd Yao-Yao graphs are not spanners for all cases.
Counterexamples exist for all odd Yao-Yao graphs.
The result resolves a long-standing open problem.
Abstract
It is a long standing open problem whether Yao-Yao graphs are all spanners [li2002sparse]. Bauer and Damian [bauer2013infinite] showed that all for are spanners. Li and Zhan [li2016almost] generalized their result and proved that all even Yao-Yao graphs are spanners (for ). However, their technique cannot be extended to odd Yao-Yao graphs, and whether they are spanners are still elusive. In this paper, we show that, surprisingly, for any integer , there exist odd Yao-Yao graph instances, which are not spanners.
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
TopicsAdvanced Graph Theory Research · Graph Labeling and Dimension Problems · Computational Geometry and Mesh Generation
