Allred, Sarah; Ding, Guoli; Oporowski, Bogdan Unavoidable induced subgraphs of large 2-connected graphs. (English) Zbl 1516.05138 SIAM J. Discrete Math. 37, No. 2, 684-698 (2023). MSC: 05C55 05C75 05C60 PDFBibTeX XMLCite \textit{S. Allred} et al., SIAM J. Discrete Math. 37, No. 2, 684--698 (2023; Zbl 1516.05138) Full Text: DOI arXiv
Di Nasso, Mauro; Goldbring, Isaac; Lupini, Martino Nonstandard methods in Ramsey theory and combinatorial number theory. (English) Zbl 1432.05001 Lecture Notes in Mathematics 2239. Cham: Springer (ISBN 978-3-030-17955-7/pbk; 978-3-030-17956-4/ebook). xvi, 204 p. (2019). Reviewer: M. P. Chaudhary (New Delhi) MSC: 05-02 05D10 05C55 11B75 26E35 00-01 00-02 03H05 28E05 30G06 46S20 47S20 54J05 PDFBibTeX XMLCite \textit{M. Di Nasso} et al., Nonstandard methods in Ramsey theory and combinatorial number theory. Cham: Springer (2019; Zbl 1432.05001) Full Text: DOI arXiv Link
Vlitas, Dimitris An infinite self-dual Ramsey theorem. (English) Zbl 1386.03059 Adv. Math. 313, 50-61 (2017). Reviewer: Thomas Britz (Sydney) MSC: 03E05 05D10 05C55 03E02 03E15 PDFBibTeX XMLCite \textit{D. Vlitas}, Adv. Math. 313, 50--61 (2017; Zbl 1386.03059) Full Text: DOI arXiv
Lenz, John; Mubayi, Dhruv Multicolor Ramsey numbers for complete bipartite versus complete graphs. (English) Zbl 1311.05121 J. Graph Theory 77, No. 1, 19-38 (2014). Reviewer: Reinhardt Euler (Brest) MSC: 05C55 05C50 PDFBibTeX XMLCite \textit{J. Lenz} and \textit{D. Mubayi}, J. Graph Theory 77, No. 1, 19--38 (2014; Zbl 1311.05121) Full Text: DOI arXiv
Kreuzer, Alexander; Kohlenbach, Ulrich Ramsey’s theorem for pairs and provably recursive functions. (English) Zbl 1221.03059 Notre Dame J. Formal Logic 50, No. 4, 427-444 (2009). Reviewer: Laurenţiu Leuştean (Bucureşti) MSC: 03F10 03F35 05D10 PDFBibTeX XMLCite \textit{A. Kreuzer} and \textit{U. Kohlenbach}, Notre Dame J. Formal Logic 50, No. 4, 427--444 (2009; Zbl 1221.03059) Full Text: DOI
Gyárfás, András; Ruszinkó, Miklós; Sárközy, Gábor N.; Szemerédi, Endre Three-color Ramsey numbers for paths. (English) Zbl 1175.05093 Combinatorica 27, No. 1, 35-69 (2007). Reviewer: Stanislav Jendrol (Kosice) MSC: 05C55 05C38 PDFBibTeX XMLCite \textit{A. Gyárfás} et al., Combinatorica 27, No. 1, 35--69 (2007; Zbl 1175.05093) Full Text: DOI
Schröder, Meike Partition regular systems of linear inequalities. (English) Zbl 0878.05081 Bielefeld: Univ. Bielefeld, Fak. f. Math. 73 S. (1996). MSC: 05D10 05A17 15A39 PDFBibTeX XMLCite \textit{M. Schröder}, Partition regular systems of linear inequalities. Bielefeld: Univ. Bielefeld, Fak. f. Math. (1996; Zbl 0878.05081)
Fouché, W. L. Reflective properties of free semigroups. (English) Zbl 0815.20044 Q. J. Math., Oxf. II. Ser. 44, No. 176, 435-449 (1993). Reviewer: T.Tamura (Davis) MSC: 20M05 06A07 05A05 PDFBibTeX XMLCite \textit{W. L. Fouché}, Q. J. Math., Oxf. II. Ser. 44, No. 176, 435--449 (1993; Zbl 0815.20044) Full Text: DOI
Gessel, Ira (ed.); Rota, Gian-Carlo (ed.) Classic papers in combinatorics. (English) Zbl 0612.05001 Boston-Basel-Stuttgart: Birkhäuser. x, 489 p.; DM 118.00 (1987). MSC: 05-03 05-02 05-06 00B60 01A60 PDFBibTeX XML
Erdős, Pál; Rado, R. A partition calculus in set theory. (English) Zbl 0071.05105 Bull. Am. Math. Soc. 62, 427-489 (1956). Reviewer: G.Kurepa MSC: 05D10 03E05 PDFBibTeX XMLCite \textit{P. Erdős} and \textit{R. Rado}, Bull. Am. Math. Soc. 62, 427--489 (1956; Zbl 0071.05105) Full Text: DOI
Erdős, Pál; Rado, R. A combinatorial theorem. (English) Zbl 0038.15301 J. Lond. Math. Soc. 25, 249-255 (1950). Reviewer: H. Rohrbach (Mainz) MSC: 05D10 PDFBibTeX XMLCite \textit{P. Erdős} and \textit{R. Rado}, J. Lond. Math. Soc. 25, 249--255 (1950; Zbl 0038.15301) Full Text: DOI
Erdős, Pál; Szekeres, George A combinatorial problem in geometry. (English) JFM 61.0651.04 Compositio math. 2, 463-470 (1935). Reviewer: Schönhardt, E., Prof. (Stuttgart) MSC: 51-XX PDFBibTeX XMLCite \textit{P. Erdős} and \textit{G. Szekeres}, Compos. Math. 2, 463--470 (1935; JFM 61.0651.04) Full Text: EuDML