A note on nearly platonic graphs
| Autor: | Froncek, Dalibor, Keith, William J., Kreher, Donald L. |
|---|---|
| Rok vydání: | 2016 |
| Předmět: | |
| Druh dokumentu: | Working Paper |
| Popis: | A nearly platonic graph is a k-regular simple planar graph in which all but a small number of the faces have the same degree. We show that it is impossible for a finite graph to have exactly one disparate face, and offer some conjectures, including the conjecture that graphs with two disparate faces come in a small set of families. Comment: Although we did not find a statement of our main result in a literature search, we remain suspicious that it might be folklore, so we strongly encourage contacting the authors if you know of a previous publication of our main theorem! |
| Databáze: | arXiv |
| Externí odkaz: |
|