15.Dushnik,Ben;Miller,E.W.(1941)."Partially ordered sets".American Journal of Mathematics 63(3):600-610.doi:10.23072371374(htps:ldoi.org/10.2307%2F2371374) hdl:10338.dmlcz/100377(https://hdl.handle.net/10338.dmlcz%2F100377).JSTOR 2371374(htt 16.Hirschfeldt,Denis R.(2014).Slicing the Truth.Lecture Notes Series of the Institute for Mathematical Sciences,National University of Singapore.28.World Scientific. 17.Diestel,Reinhard(2010)."Chapter 8,Infinite Graphs".Graph Theory (4 ed.).Heidelberg Springer--Verlag.pp.209-2010.ISBN978-3-662-53621-6. 18.Smith,Warren D.:Exoo,Geoff,Partial Answer to Puzzle #27:A Ramsey-like quantity (http://Ra ngeVoting.org/PuzzRamsey.html).retrieved 2020-06-02 19 ang,He 20161"DE eg502301. s on abs1510.01884) Physical ttps:/ Bibcode:2016PhRvA..93c2301W (https://ui.adsabs.h org/ du/abs/2016PhRvA..93c2301W) doi10.1103/PhysRevA.93.032301htps:/doi.0rg/10.11039%2 FPhysRevA.93.032301. References Ajtai,Miklos:Koml6s,Janos:Szemeredi,Endre(1980)."A note on Ramsey numbers",J. C0mbin.Theory Ser..A,29(3):354-360,doi:10.1016/0097-3165(80)90030-8htps:ldoi.org/10 1016%2F0097-31659%28809%2990030-8). Tom;Keevash,Peter(2010),"The early evolution of the H-free process".Invent. Math,1812y:291-336,arXiv:0908.0429htps/axiv.org/abs/0908.0429). Bibcode:2010InMat.181..291B(https://ui.adsabs.harvard.edu/abs/2010InMat.181..291B) doi:10.1007/s00222-010-0247-×htps:doi1.0rg/10.1007%2Fs00222-010-0247-x) Brualdi,Richard A.(2010),Introductory Combinatorics(5th ed.),Prentice-Hall,pp.77-82 1SBN978.0-13-602040-0 ath/0607788 d ey num di104007 annals.2009.170.941G 0rg/10.40079%2 Fannals.2009.170.941. MR 2552114(https://www.ams.org/mathscinet-getitem?mr=2552114). arks on thethe 7-08785-1) Erd6s,P.;M r.L.(1964)."nh repre on of di ected s of orderings"(ht Mate atikai Kutato Inteze erenek Kozlemenyei,9:125-132.MR 0168494 (hups:/www.ams.org/ mathscinet-getitem?mr=0168494) Erdos,Pau do (PDE) natorial pr doi:10 100 7978.0-8176484283hps010r010100762F9780-8176484283. 1sBN978-0-8176-4841-1. ,5) :97-98 ://do /10.10 262Fj9t3190130113 Graham,R.;Rothschild,B.;Spencer,J.H.(1990),Ramsey Theory,New York:John Wiley and ons Gross,Jonathan L.(2008),Combinatorial Methods with Computer Applications,CRC Press, p.458,1SBN978-1-58488-743-0 Harary,Frank(1972),Graph Theory,Addison-Wesley,pp.16-17,ISBN 0-201-02787-9 s9%2Fs2-3 Ajtai, Miklós; Komlós, János; Szemerédi, Endre (1980), "A note on Ramsey numbers", J. Combin. Theory Ser. A, 29 (3): 354–360, doi:10.1016/0097-3165(80)90030-8 (https://doi.org/10. 1016%2F0097-3165%2880%2990030-8). Bohman, Tom; Keevash, Peter (2010), "The early evolution of the H-free process", Invent. Math., 181 (2): 291–336, arXiv:0908.0429 (https://arxiv.org/abs/0908.0429), Bibcode:2010InMat.181..291B (https://ui.adsabs.harvard.edu/abs/2010InMat.181..291B), doi:10.1007/s00222-010-0247-x (https://doi.org/10.1007%2Fs00222-010-0247-x) Brualdi, Richard A. (2010), Introductory Combinatorics (5th ed.), Prentice-Hall, pp. 77–82, ISBN 978-0-13-602040-0 Conlon, David (2009), "A new upper bound for diagonal Ramsey numbers", Annals of Mathematics, 170 (2): 941–960, arXiv:math/0607788v1 (https://arxiv.org/abs/math/0607788v1), doi:10.4007/annals.2009.170.941 (https://doi.org/10.4007%2Fannals.2009.170.941), MR 2552114 (https://www.ams.org/mathscinet-getitem?mr=2552114). Erdős, Paul (1947), "Some remarks on the theory of graphs", Bull. Amer. Math. Soc., 53 (4): 292–294, doi:10.1090/S0002-9904-1947-08785-1 (https://doi.org/10.1090%2FS0002-9904-194 7-08785-1). Erdős, P.; Moser, L. (1964), "On the representation of directed graphs as unions of orderings" (ht tps://users.renyi.hu/~p_erdos/1964-22.pdf) (PDF), A Magyar Tudományos Akadémia, Matematikai Kutató Intézetének Közleményei, 9: 125–132, MR 0168494 (https://www.ams.org/ mathscinet-getitem?mr=0168494) Erdős, Paul; Szekeres, George (1935), "A combinatorial problem in geometry" (http://www.num dam.org/article/CM_1935__2__463_0.pdf) (PDF), Compositio Mathematica, 2: 463–470, doi:10.1007/978-0-8176-4842-8_3 (https://doi.org/10.1007%2F978-0-8176-4842-8_3), ISBN 978-0-8176-4841-1. Exoo, G. (1989), "A lower bound for R(5,5)", Journal of Graph Theory, 13: 97–98, doi:10.1002/jgt.3190130113 (https://doi.org/10.1002%2Fjgt.3190130113). Graham, R.; Rothschild, B.; Spencer, J. H. (1990), Ramsey Theory, New York: John Wiley and Sons. Gross, Jonathan L. (2008), Combinatorial Methods with Computer Applications, CRC Press, p. 458, ISBN 978-1-58488-743-0 Harary, Frank (1972), Graph Theory, Addison-Wesley, pp. 16–17, ISBN 0-201-02787-9 Ramsey, F. P. (1930), "On a problem of formal logic", Proceedings of the London Mathematical Society, 30: 264–286, doi:10.1112/plms/s2-30.1.264 (https://doi.org/10.1112%2Fplms%2Fs2-3 15. Dushnik, Ben; Miller, E. W. (1941). "Partially ordered sets". American Journal of Mathematics. 63 (3): 600–610. doi:10.2307/2371374 (https://doi.org/10.2307%2F2371374). hdl:10338.dmlcz/100377 (https://hdl.handle.net/10338.dmlcz%2F100377). JSTOR 2371374 (htt ps://www.jstor.org/stable/2371374). MR 0004862 (https://www.ams.org/mathscinet-getitem?mr= 0004862).. See in particular Theorems 5.22 and 5.23. 16. Hirschfeldt, Denis R. (2014). Slicing the Truth. Lecture Notes Series of the Institute for Mathematical Sciences, National University of Singapore. 28. World Scientific. 17. Diestel, Reinhard (2010). "Chapter 8, Infinite Graphs". Graph Theory (4 ed.). Heidelberg: Springer-Verlag. pp. 209–2010. ISBN 978-3-662-53621-6. 18. Smith, Warren D.; Exoo, Geoff, Partial Answer to Puzzle #27: A Ramsey-like quantity (http://Ra ngeVoting.org/PuzzRamsey.html), retrieved 2020-06-02 19. Wang, Hefeng (2016). "Determining Ramsey numbers on a quantum computer". Physical Review A. 93 (3): 032301. arXiv:1510.01884 (https://arxiv.org/abs/1510.01884). Bibcode:2016PhRvA..93c2301W (https://ui.adsabs.harvard.edu/abs/2016PhRvA..93c2301W). doi:10.1103/PhysRevA.93.032301 (https://doi.org/10.1103%2FPhysRevA.93.032301). References