2 papers
math.CO2026
Upper bounds for the average size of maximal matchings in bicyclic graphs
Kai Zhang
For a graph , let avm() denote the average size of its maximal matchings. Engbers and Erey initiated the extremal study of this parameter and asked for extensions from trees…
math.CO2026
Extremal graphs for average size of maximal matchings in bicyclic graphs
Kai Zhang
For a graph \(G\), let denote the average size of its maximal matchings. This parameter was introduced by Engbers and Erey in the study of extremal problems for maximal ma…