Chord theorems on graphs
| dc.creator | Javaheri, Mohammad | |
| dc.date | 2007-02-27 | |
| dc.date | 2007-09-20 | |
| dc.date.accessioned | 2026-07-07T08:31:09Z | |
| dc.date.available | 2026-07-07T08:31:09Z | |
| dc.description | The Horizontal Chord Theorem states that if a continuous curve connects points $A$ and $B$ in the plane, then for any integer $k$ there are points $C$ and $D$ on the curve such that $\overrightarrow{AB}=k \overrightarrow{CD}$. In this note, we discuss a few combinatorial-analysis problems related to this theorem and introduce a different formulation that gives way to generalizations on graphs. | |
| dc.description | 10 pages | |
| dc.identifier | https://arxiv.org/abs/math/0702805 | |
| dc.identifier | http://arxiv.org/abs/math/0702805 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/138428 | |
| dc.subject | Group Theory | |
| dc.subject | 05C40, 05C45, 05C75 | |
| dc.title | Chord theorems on graphs | |
| dc.type | text |