A proof of the McKay-Radziszowski subgraph counting conjecture
Alexander Engstrom
所有作者
Alexander Engstrom
文献摘要
We prove a theorem on how to count induced subgraphs in neighborhoods of
graphs. Then we use it to prove a subgraph counting identity conjectured by
McKay and Radziszowski in there work on Ramsey theory.