Timeline for Three Stacks N cards
Current License: CC BY-SA 3.0
15 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 14, 2021 at 14:18 | history | edited | hexomino |
edited tags
|
|
| Jul 19, 2016 at 20:01 | comment | added | Ovi | This would be a nice problem on math.SE, wanna ask it there too? | |
| Jul 19, 2016 at 19:17 | answer | added | Ldddd | timeline score: -2 | |
| Jul 19, 2016 at 15:46 | answer | added | Fabich | timeline score: 3 | |
| Jul 18, 2016 at 21:41 | comment | added | Jonathan Allan | Is there a nice way to get to the answer instead of a brute force approach like that used by @czarlarry though? | |
| Jul 18, 2016 at 20:18 | answer | added | czarlarry | timeline score: 7 | |
| Jul 18, 2016 at 17:11 | answer | added | Marius | timeline score: -1 | |
| Jul 18, 2016 at 16:57 | comment | added | user2357112 | @Trenin: You might have misread the definition of a k-partite graph. All edges have to go from one part to a different part; edges between members of the same part are forbidden. | |
| Jul 18, 2016 at 16:54 | comment | added | Trenin | @user2357112 If this is the case, then wouldn't the two vertices that share an edge still be in the same set? You want the opposite - i.e. no such edge exists between elements of any set. | |
| Jul 18, 2016 at 16:38 | comment | added | user2357112 | If we construct a graph with the integers from 1 to n as vertices and an edge between any two numbers that sum to a square, this question is asking for the highest n such that the resulting graph is tripartite. Testing whether a graph is tripartite is NP-complete; there is no simple check for it. | |
| Jul 18, 2016 at 15:57 | answer | added | hexomino | timeline score: 2 | |
| Jul 18, 2016 at 15:56 | answer | added | Jonathan Allan | timeline score: 5 | |
| Jul 18, 2016 at 14:12 | answer | added | Laurent | timeline score: 1 | |
| Jul 18, 2016 at 12:47 | review | First posts | |||
| Jul 18, 2016 at 12:50 | |||||
| Jul 18, 2016 at 12:47 | history | asked | rasim | CC BY-SA 3.0 |