Chord theorems on graphs

Mathematics – Group Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

10 pages

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Chord theorems on graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Chord theorems on graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Chord theorems on graphs will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-207147

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.