Timeline for Edges of $K_n$ are colored, connected few-colored subgraph is needed
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 5, 2015 at 18:09 | answer | added | Victor Kleptsyn | timeline score: 2 | |
| Mar 5, 2015 at 18:04 | comment | added | Gerhard Paseman | I should think so. Not an argument, but the following might become one. Suppose one tries to select m colors from a colored graph, say by choosing the m most popular colors. If it fails, the complement contains a connected and complete bipartite graph, which presumably has many more edges because n is so large. This should at least give bounds on n. Gerhard "Can't Count: Not Enough Coffee" Paseman, 2015.03.05 | |
| Mar 5, 2015 at 9:41 | history | asked | Fedor Petrov | CC BY-SA 3.0 |