An Erdős-Gallai-type theorem for keyrings with larger number of leaves

Xinmin Hou, Xiaodong Xue

A keyring is a graph obtained from a cycle by appending $r\ge 0$ leaves to one of its vertices. Sidorenko proved an Erdős-Gallai-type theorem: Every graph of order $n$ and size more…