A proof of the McKay-Radziszowski subgraph counting conjecture
Combinatorics
2010-05-18 v3
Abstract
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.
Keywords
Cite
@article{arxiv.1002.4304,
title = {A proof of the McKay-Radziszowski subgraph counting conjecture},
author = {Alexander Engstrom},
journal= {arXiv preprint arXiv:1002.4304},
year = {2010}
}
Comments
11 pages; typos fixed