Timeline for Degree conditions for k-factor
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 4, 2012 at 23:33 | vote | accept | Felix Goldberg | ||
| Apr 4, 2012 at 10:04 | answer | added | Gjergji Zaimi | timeline score: 3 | |
| Apr 4, 2012 at 8:58 | history | edited | Felix Goldberg | CC BY-SA 3.0 |
edited body; edited tags
|
| Apr 4, 2012 at 8:57 | comment | added | Felix Goldberg | Hold on a sec: $K_{2n+1}$ does have a 2-factor, right? So maybe it's still possible? | |
| Apr 4, 2012 at 8:34 | comment | added | Felix Goldberg | You are right. What's the simplest I can get, then? | |
| Apr 4, 2012 at 4:16 | comment | added | Tony Huynh | Note that $\delta(G) \geq f(k)$ will not do since there are graphs of arbitrarily high minimum degree without 1-factors (e.g $K_{2n+1}$). | |
| Apr 4, 2012 at 2:28 | history | edited | Felix Goldberg | CC BY-SA 3.0 |
added 240 characters in body
|
| Apr 4, 2012 at 2:16 | history | asked | Felix Goldberg | CC BY-SA 3.0 |