Erdős Problem #767 — A cycle with many chords at one vertex

About 57 years old · traced to 1969

Let $g_k(n)$ be the largest number of edges in an $n$ -vertex graph having no cycle with $k$ chords incident to a single vertex of the cycle. Is $g_k(n)=(k+1)n-(k+1)^2$ for all sufficiently large $n$ ?

References

Primary source

P. Erdős, Problems and results in chromatic graph theory, in Proof Techniques in Graph Theory (Proc. Second Ann Arbor Graph Theory Conf., 1968), Academic Press (1969), 27–35.

Additional references

P. Erdős, Problems and results in chromatic graph theory, in Proof Techniques in Graph Theory (Proc. Second Ann Arbor Graph Theory Conf., 1968), Academic Press (1969), 27–35.

graph-theory turan-number

InErdős Problems

Posted 1 month ago

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

No solutions have been posted yet.