Timeline for Does a graph with all vertex degrees divisible by 3 contain a cubic subgraph?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 11, 2012 at 0:02 | vote | accept | Douglas S. Stones | ||
| Nov 10, 2012 at 23:45 | comment | added | Brendan McKay | As Kevin noted with the smallest example, any connected graph having all but one vertex of degree 3 and the other vertex of higher degree is a counterexample. But to kill this idea properly, counterexamples with arbitrarily high minimum degree would be nice. | |
| Nov 10, 2012 at 23:23 | answer | added | Kevin Ventullo | timeline score: 14 | |
| Nov 10, 2012 at 22:43 | history | asked | Douglas S. Stones | CC BY-SA 3.0 |