weird combinatorics problem | Mathematics | Page 1

brittle rover Oct 4, 2022, 7:06 PM

#

,tex In a circle there is finite number of chords marked. A "cycle" is
a closed polygonal chain which consists of at least 3 distinct marked chords.
Polygonal chains are the same only if they consist of the same set of chords.
It turns out that there is a cycle $C$ that consists of $n$ chords ($n$ is even) with the following property every cycle shares at least one chord with $C$. Determine the maximum number of cycles.

pine baneBOT Oct 4, 2022, 7:06 PM

#

detectivemiller

brittle rover Oct 4, 2022, 7:07 PM

#

help would be appreciated because I spent two days on it and got nothing

brittle rover Oct 5, 2022, 4:03 PM

#

please, I have a deadline tomorrow

#weird combinatorics problem