Timeline for n-partite n-clique
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Sep 11, 2013 at 18:34 | history | edited | Ben Webster♦ | CC BY-SA 3.0 |
minor TeX changes and text optimization
|
| S Sep 11, 2013 at 18:34 | history | suggested | Sergiy Kozerenko | CC BY-SA 3.0 |
minor TeX changes and text optimization
|
| Sep 11, 2013 at 18:16 | review | Suggested edits | |||
| Sep 11, 2013 at 18:34 | |||||
| May 27, 2011 at 11:17 | vote | accept | Pawan Aurora | ||
| May 25, 2011 at 13:46 | comment | added | fedja | Yes, of course. I posted the details to finish it off. | |
| May 25, 2011 at 13:45 | comment | added | Klaus Draeger | You would need at least some constraint on the number of isolated vertices, wouldn't you? Currently, the graph with no edges at all is a counterexample. | |
| May 25, 2011 at 13:43 | answer | added | fedja | timeline score: 3 | |
| May 25, 2011 at 12:52 | comment | added | gowers | I haven't checked, but it seems likely to me that a random graph will be a counterexample: you need a very high edge probability to get an n-clique and I think probably a lot lower to satisfy your conditions with high probability. | |
| May 25, 2011 at 12:44 | comment | added | gowers | FWIW here is a reformulation (I think). Let G be a graph with vertex set the edges of the complete bipartite graph K(n,n). Suppose that each vertex of G is contained in a perfect matching in K(n,n) and is joined to all the other edges in that perfect matching. Prove that G contains an n-clique. | |
| May 25, 2011 at 12:06 | history | edited | Harry Gindi |
edited tags
|
|
| May 25, 2011 at 11:32 | history | edited | Pawan Aurora | CC BY-SA 3.0 |
added 2 characters in body
|
| May 25, 2011 at 11:27 | history | asked | Pawan Aurora | CC BY-SA 3.0 |