A proof of the McKay-Radziszowski subgraph counting conjecture
Alexander Engstrom
TL;DR
This paper proves a theorem for counting induced subgraphs in neighborhoods and uses it to confirm a conjecture by McKay and Radziszowski related to subgraph counting in Ramsey theory.
Contribution
It introduces a new theorem for counting induced subgraphs and verifies a longstanding conjecture in the field of graph theory.
Findings
Proved a theorem for counting induced subgraphs in neighborhoods.
Confirmed the McKay-Radziszowski subgraph counting conjecture.
Enhanced understanding of subgraph enumeration in Ramsey theory.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Topology and Set Theory · Advanced Graph Theory Research