A Short Proof of the Size of Edge-Extremal Chordal Graphs

Abstract

[3] have recently determined the maximum number of edges of a chordal graph with a maximum degree less than $d$ and the matching number at most $\nu$ by exhibiting a family of chordal graphs achieving this bound. We provide simple proof of their result.

Keywords

• chordal graphs
• edge-extremal graphs
• matching number