# Browse Dissertations and Theses - Mathematics by Subject "Matching"

• (2011-08-25)
We study extremal and structural problems in regular graphs involving various parameters. In Chapter 2, we obtain the best lower bound for the matching number over $n$-vertex connected regular graphs in terms of ...

application/pdf

PDF (816kB)
• (2017-04-05)
A classical problem in combinatorics is, given graphs G and H, to determine if H is a subgraph of G. It is usually computationally complex to determine if H is a subgraph of G. Therefore, we often prove conditions that ...

application/pdf

PDF (942kB)