Subgraphs of diameter 1 in graphs of girth 2
Appears in collection : Metric Graph Theory and Related Topics / Théorie métrique des graphes et interactions
Let $G$ be a finite leafless subgraph of diameter 1 in a graph of girth 2. We prove that all cycles of $G$ and paths of $G$ joining vertices of degree at least 3 in $G$ have rational length. This is joint work with Sergey Norin and Damian Osajda.
