Timeline for Can infinity shorten proofs a lot?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 27, 2019 at 22:06 | comment | added | bof | @KristalCantwell As indicated in the title of the paper you cited, this result was first proved (constructively and more generally) by Jon Folkman; it is the result $f(3,3)=3$ in his 1970 paper Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring. | |
| Mar 12, 2015 at 17:42 | comment | added | Kristal Cantwell | There are other proofs of this. Lin Lu has a construction on 9697 vertices see Linyuan Lu. (2008) Explicit Construction of Small Folkman Graphs. SIAM Journal on Discrete Mathematics 21:4, 1053-1060. available at epubs.siam.org/doi/pdf/10.1137/070686743 | |
| Mar 12, 2015 at 16:50 | comment | added | Rahman. M | very nice, mohammad golshani! | |
| Mar 12, 2015 at 16:44 | history | answered | Mohammad Golshani | CC BY-SA 3.0 |