A proof of the McKay-Radziszowski subgraph counting conjecture
classification
🧮 math.CO
keywords
countingprovesubgraphconjectureconjecturedcountgraphsidentity
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.