2007/02/27 by Mohammad Javaheri, Javaheri, Mohammad
Computer Science · Mathematics · #05C40 #05C45 #05C75 #Advanced Graph Theory Research #Computational Geometry and Mesh Generation #FOS: Mathematics #Graph Labeling and Dimension Problems #Group Theory (math.GR) #math.GR #msc:05C40 #msc:05C45 #msc:05C75
paper · pdf · doi:10.48550/arxiv.math/0702805
10 pages
openalex publication_date 2007/02/27 · arxiv created 2007/09/20 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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=k \overrightarrowCD. 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.