김린기

The strong clique number of a graph $G$ is the maximum size of a set of edges of which every pair has distance at most two. In this talk, we prove that every  $\{C_5,C_{2k}\}$-free graph has strong clique number at most $k\Delta(G)-(k-1)$, which resolves a conjecture by  Cames van Batenburg et al. We also prove …