A proof of the McKay-Radziszowski subgraph counting conjecture

Details A proof of the McKay-Radziszowski subgraph counting conjecture A proof of the McKay-Radziszowski subgraph counting conjecture

2010-02-23

arxiv.org/abs/1002.4304v3

Mathematics

Combinatorics

11 pages; typos fixed

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A proof of the McKay-Radziszowski subgraph counting conjecture does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A proof of the McKay-Radziszowski subgraph counting conjecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A proof of the McKay-Radziszowski subgraph counting conjecture will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-170048