Triangle-free Graphs with Large Minimum Common Degree

Jian Wang, Weihua Yang, Fan Zhao

Let $G$ be a graph. For $x\in V(G)$, let $N(x)=\{y\in V(G):xy\in E(G)\}$. The minimum common degree of $G$, denoted by $\hat{I}{´}_2(G)$, is defined as the minimum of $|N(x)\cap N(…