Category Archives: graphs

Partitions of Graphs XI: The Case of all Sufficiently Large n

Posted on December 17, 2009 by

This the eleventh in a series, the first being found here: Part 1, and the previous here Part 10. In this post I provide examples of Q1 graphs of all orders n, for sufficiently large n.  In particular this will … Continue reading →

Posted in graphs | Tagged , , , , | 1 Comment

Partitions of Graphs X: The Case of Composite Integers

Posted on November 27, 2009 by

This is the tenth in a series, the first being found here: Part 1, and the previous here: Part 9. In this post I introduce a family of graphs that provides examples of Q1 graphs for all composite orders.  If … Continue reading →

Posted in graphs | Tagged , , , | 2 Comments

Evening of Math VI

Posted on November 24, 2009 by

It was late and rushed tonight, but I did manage to do some math with the kids. Actually, A was throwing fits, so I put her to bed. I had B working on the fact that if you have a … Continue reading →

Posted in children, graphs | Leave a comment

A Morning of Math

Posted on October 30, 2009 by

I’ve been sick and had to stay home from work the last several days. This morning I told my kids that they could choose to put away their clothes or do math. They chose math. I set both B and … Continue reading →

Posted in children, graphs | Tagged | 2 Comments

The Chicken’s Claw

Posted on October 19, 2009 by

I had my fifth evening of math with my kids.  I got a box of 100 washers from the hardware store and some yarn.  I had the kids draw some graphs and then make some graphs with the washers as … Continue reading →

Posted in children, graphs | Tagged | Leave a comment

Partitions of Graphs IX: The case of 13

Posted on March 16, 2009 by

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 o /      o-o-o-o-o-o-o-o-o-o \ o-o The corresponding Q1 partition is 5+5+3.  Unfortunately this … Continue reading →

Posted in graphs | Tagged , , | 1 Comment

Partitions of Graphs VIII: The case of 11 (and 17)

Posted on March 13, 2009 by

This is the eighth in a series, the first being here: Part I and the previous here: Part 7. We have shown that there are no Q1 graphs with n=5 nodes or with n=7 nodes.  Also, in the case of … Continue reading →

Posted in graphs | Tagged , , | Leave a comment