Timeline for Another funny kind of Ramsey number
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 4, 2018 at 1:50 | comment | added | LeechLattice | My answer is 21. The graphs are shown in here. | |
| Jul 4, 2018 at 0:36 | comment | added | bof | Thank you for your answer! In my (tedious and error-prone) pen-and-paper work, I seemed to find 19 7-vertex graphs with no instance of W. How close is that to the correct number? | |
| Jul 4, 2018 at 0:31 | vote | accept | bof | ||
| Jul 3, 2018 at 17:11 | comment | added | LeechLattice | The graphs are generated by B.D.Mckay's program geng, and the computation on a individual graph is brute-force: simply enumerate all the size-4 and size-5 sets of the graph, and test whether there is a clique or a union of two cliques. | |
| Jul 3, 2018 at 17:06 | comment | added | Andrés E. Caicedo | Could you provide some details on how to (efficiently) carry out a computation such as this? This is probably standard, so if instead there is a reference you'd recommend, I would be grateful. | |
| Jul 3, 2018 at 14:05 | history | answered | LeechLattice | CC BY-SA 4.0 |