Caro, Davila, and Pepper (arXiv:1909.09093) recently proved $δ(G) α(G)\leq Δ(G) μ(G)$ for every graph $G$ with minimum degree $δ(G)$, maximum degree $Δ(G)$, independence number $α(G)$, and matching number $μ(G)$. Answering some problems they posed, we characterize the extremal graphs for $δ(G)<Δ(G)$ as well as for $δ(G)=Δ(G)=3$.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。