Timeline for Graphs with few induced subgraphs
Current License: CC BY-SA 3.0
14 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Aug 8, 2011 at 11:28 | comment | added | Tony Huynh | Thanks Peter. The link seems to be broken, but I was already familiar with your blog so found it. If you don't mind, I edited the question to link to the said blog entry. | |
Aug 8, 2011 at 9:04 | comment | added | cameroncounts | I have described the background to the problem in a little more detail <a href="cameroncounts.wordpress.com/2011/08/05/mathoverflow/…>. | |
Aug 7, 2011 at 0:59 | history | edited | Tony Huynh | CC BY-SA 3.0 |
deleted 79 characters in body
|
Aug 5, 2011 at 12:03 | history | edited | Tony Huynh | CC BY-SA 3.0 |
deleted 239 characters in body
|
Aug 5, 2011 at 12:02 | comment | added | Douglas S. Stones | Oops you're right, that doesn't work either. I was thinking $C_7$. | |
Aug 5, 2011 at 11:57 | comment | added | Tony Huynh | Ah, I missed $P_3$ for some reason. But I also don't think $C_9$ works either since it does contain the null graph as an induced subgraph. | |
Aug 5, 2011 at 11:51 | history | edited | Tony Huynh | CC BY-SA 3.0 |
deleted 37 characters in body
|
Aug 5, 2011 at 11:49 | comment | added | Douglas S. Stones | Only odd cycle of length 9 works. Otherwise you get (a) null graph, (b) P_2, (c) P_3, (d) P_4 and (e) P_2 \cup P_2. [where P_i = path with i vertices]. With a 9-cycle, you can't get an induced null graph. | |
Aug 5, 2011 at 11:44 | history | edited | Tony Huynh | CC BY-SA 3.0 |
deleted 20 characters in body
|
Aug 5, 2011 at 11:36 | history | edited | Tony Huynh | CC BY-SA 3.0 |
edited body
|
Aug 5, 2011 at 11:36 | comment | added | Tony Huynh | Indeed, edited accordingly. | |
Aug 5, 2011 at 11:29 | comment | added | Douglas S. Stones | Note: 4 is not less than 5/2. | |
Aug 5, 2011 at 11:26 | history | edited | Tony Huynh | CC BY-SA 3.0 |
added 21 characters in body
|
Aug 5, 2011 at 11:21 | history | answered | Tony Huynh | CC BY-SA 3.0 |