Skip to content

Author

Kainan Zhang

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Aug 2026

Upper bounds for the average size of maximal matchings in bicyclic graphs

For a graph $G$, let avm($G$) denote the average size of its maximal matchings. Engbers and Erey initiated the extremal study of this parameter and asked for extensions from trees and unicyclic graphs to $k$-cyclic graphs. In this paper, we determine the maximum value of avm($G$) over all connected bicyclic graphs with...

Kainan Zhang · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.