Damásdi, Gábor (2023) Odd Wheels Are Not Odd-Distance Graphs. DISCRETE AND COMPUTATIONAL GEOMETRY, 69 (2). pp. 327-337. ISSN 0179-5376
|
Text
s00454-021-00325-0.pdf - Published Version Available under License Creative Commons Attribution. Download (339kB) | Preview |
Official URL: https://doi.org/10.1007/s00454-021-00325-0
Abstract
An odd wheel graph is a graph formed by connecting a new vertex to all vertices of an odd cycle. We answer a question of Rosenfeld and Le by showing that odd wheels cannot be drawn in the plane so that the lengths of the edges are odd integers.
| Item Type: | Article |
|---|---|
| Additional Information: | Export Date: 21 February 2023 Correspondence Address: Damásdi, G.; MTA-ELTE Lendület Combinatorial Geometry Research Group, Hungary; email: damasdigabor@caesar.elte.com Funding text 1: We would like to thank SciExperts for providing free access to the software Wolfram Mathematica, and therefore to the database of Ed Pegg Jr. [16] on embeddings of wheels. We also thank Nóra Frankl, Dömötör Pálvölgyi, and our anonymous reviewers for valuable suggestions and encouragement. |
| Uncontrolled Keywords: | DISTANCE GEOMETRY; Forbidden subgraphs; Odd-distance graphs; |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 12 Sep 2025 13:29 |
| Last Modified: | 12 Sep 2025 13:29 |
| URI: | https://real.mtak.hu/id/eprint/224103 |
Actions (login required)
 |
Edit Item |
