Chord theorems on graphs

From MaRDI portal



Abstract: 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 overrightarrowAB=koverrightarrowCD. 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.












This page was built for publication: Chord theorems on graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3605007)