Partitions of Graphs IX: The case of 13

This is the ninth in a series, the first being here: Part 1, and the previous here: Part 8.

Here is a Q1 graph for n=13


The corresponding Q1 partition is 5+5+3.  Unfortunately this does not generalize.  For instance, the following graph:


prohibits the partitions 5+5+3+3+3 and 6+5+5+3, so it is Q2.

So far we have found Q1 graphs (or proven that they don\’t exist) of all orders n up through 18.  I have made very little progress with n=19.  If anyone finds an order 19 Q1 graph, please let me know about it.  I do have some more things to say about Q1 graphs and partitions, including work and suggestions by my friend Sean (as well as some more Q1 graphs).  In my next post I will start to discuss those issues.


Part 10

This entry was posted in graphs and tagged , , . Bookmark the permalink.

One Response to Partitions of Graphs IX: The case of 13

  1. Pingback: Partitions of Graphs X: The Case of Composite Integers « MATH with my KIDS

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s