The average size of matchings in graphs

DOI10.1007/s00373-020-02136-1zbMath1439.05114arXiv1903.09825OpenAlexW3005283388MaRDI QIDQ2175789

Valisoa Razanajatovo Misanantenaina, Eric Ould Dadah Andriantiana, Stephan G. Wagner

Publication date: 30 April 2020

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1903.09825

zbMATH Keywords

extremal problemsmatchingsaverage size

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)

Related Items (3)

Extremal graphs for average sizes of maximal matchings ⋮ The average order of dominating sets of a graph ⋮ On the average order of a dominating set of a forest

Cites Work

• Unnamed Item
• Extremal results on average subtree density of series-reduced trees
• The matching energy of a graph
• Monotonicity of the mean order of subtrees
• The average order of a subtree of a tree
• Matching theory
• On the average number of nodes in a subtree of a tree
• The average size of independent sets of graphs
• Graph Energy
• On the Local and Global Means of Subtree Orders
• Maximizing the mean subtree order
• Independent sets, matchings, and occupancy fractions

This page was built for publication: The average size of matchings in graphs