Ramsey-Paris-Harrington numbers for graphs

DOI10.1016/0097-3165(85)90018-4zbMATH Open0553.05054OpenAlexW2078051625MaRDI QIDQ801937FDOQ801937

Authors: George Mills 

Publication date: 1985

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(85)90018-4

Recommendations

• Some bounds for the Ramsey-Paris-Harrington numbers
• Ramsey Theorems for Multiple Copies of Graphs
• On the Ramsey numbers r(G,nH) and r(nG,nH) when n is large
• scientific article
• Ramsey numbers for sets of small graphs

zbMATH Keywords

complete subgraphlarge independent setRamsey-Paris-Harrington numbers

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Cites Work

• Some graph theoretic results associated with Ramsey's theorem
• Some bounds for the Ramsey-Paris-Harrington numbers

Cited In (4)

• Upper bounds on positional Paris-Harrington games
• On the proof complexity of Paris-Harrington and off-diagonal Ramsey tautologies
• Some bounds for the Ramsey-Paris-Harrington numbers
• Regressive Ramsey numbers are Ackermannian

This page was built for publication: Ramsey-Paris-Harrington numbers for graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q801937)