Chord theorems on graphs (revised and extended)

arXiv:math/0702805 · math.GR · Submitted 2007-02-27 · Read on arXiv

math.GR

Submitted: 2007-02-27

Updated: 2026-10-25

Comments: This is a revised and extended version of a previously published article

Journal ref: M. Javaheri, Chord theorems on graphs, Proc. Amer. Math. Soc. 137 (2009), 553--562

License: http://creativecommons.org/licenses/by/4.0/

The gist: The Horizontal Chord Theorem states that if a continuous curve connects points A and B in the plane, then for every positive integer k there are points C and D on the curve with =k,.

Terminology

Abstract

The Horizontal Chord Theorem states that if a continuous curve connects points A and B in the plane, then for every positive integer k there are points C and D on the curve with =k,. We reformulate the one-dimensional chord problem on finite metric graphs: the chord set (G) consists of those r such that every function of mean zero on G integrates to zero over some closed connected subset of G of measure r. We prove that the space of connected subsets of fixed measure is compact and path-connected, that (G) always contains the closure of a combinatorially defined partition set (G), and that the two sets agree at every rational number; as a consequence, membership of a rational number in (G) is decided by a finite linear program, and the conjecture (G)= reduces to a statement about irrational points. We give a covering lemma that yields (G)=[0,E] for Eulerian graphs, [0,1] (G) when G has no vertex of degree one, and [0,g(G)] (G) when G is bridgeless with girth g(G). Conversely, a bridge forces a gap in (G) below E. Computations on small graphs support the conjecture that (G)=[0,E] exactly when G is bridgeless.

Related papers