On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number.

We determine the maximum number of edges that a chordal graph G can have if its degree, Δ (G) , and its matching number, ν (G) , are bounded. To do so, we show that for every d , ν ∈ N , there exists a chordal graph G with Δ (G) < d and ν (G) < ν whose number of edges matches the upper bound, while having a simple structure: G is a disjoint union of cliques and stars. [ABSTRACT FROM AUTHOR]