Some graph theoretic results associated with Ramsey's theorem
From MaRDI portal
Publication:5585189
DOI10.1016/S0021-9800(68)80038-9zbMath0191.22504MaRDI QIDQ5585189
Jack E. Graver, James W. Yackel
Publication date: 1968
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Related Items (43)
On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies ⋮ SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY ⋮ Ramsey numbers \(r(K_ 3,G)\) for connected graphs \(G\) of order seven ⋮ The lower bounds of classic Ramsey number \(R(5,9)\) and \(R(5,10)\) ⋮ The Ramsey numbers for a cycle of length six or seven versus a clique of order seven ⋮ On the existence of specified cycles in complementary graphs ⋮ The Ramsey number \(R(3,K_{10}-e)\) and computational bounds for \(R(3,G)\) ⋮ The Ramsey numbers r(P\(_m\),K\(_n\)) ⋮ The Ramsey number R(3, t) has order of magnitude t2/log t ⋮ A note on Ramsey multiplicity ⋮ Ramsey numbers for matchings ⋮ A note on Ramsey numbers ⋮ Some bounds for the Ramsey-Paris-Harrington numbers ⋮ Lower bounds for bi-colored quaternary Ramsey numbers ⋮ On a generalization of Ramsey theory ⋮ On the Ramsey numbers R(3,8) and R(3,9) ⋮ On a Variation of the Ramsey Number ⋮ On Ramsey numbers for linear forests ⋮ On the Ramsey numbers for stars versus complete graphs ⋮ Ramsey graphs and block designs ⋮ New lower bounds of classical Ramsey numbers \(R(4,12)\), \(R(5,11)\) and \(R(5,12)\). ⋮ A generalization of Ramsey theory for graphs ⋮ New lower bounds for classical Ramsey numbers R(5, 13) and R(5, 14) ⋮ Ramsey numbers of partial order graphs (comparability graphs) and implications in ring theory ⋮ The triangle-free process ⋮ Ramsey Graphs and Block Designs. I ⋮ Ramsey numbers and an approximation algorithm for the vertex cover problem ⋮ Inequalities and asymptotic bounds for Ramsey numbers ⋮ An upper bound for the Ramsey number M(5,4) ⋮ On Ramsey numbers and \(K_ r\)-coloring of graphs ⋮ A Ramsey-type problem for paths in digraphs ⋮ Some lower bounds of the Ramsey number \(n(k,k)\). ⋮ A note on Hadwiger's conjecture for \(W_5\)-free graphs with independence number two ⋮ An upper bound on the Ramsey numbers R(3,k) ⋮ Ramsey numbers \(r(K_3, G)\) for \(G\cong K_7-2P_2\) and \(G\cong K_7-3P_2\) ⋮ Path-star Ramsey numbers ⋮ Difference Ramsey numbers and Issai numbers ⋮ Some Ramsey nu mbers for directed graphs ⋮ Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time. ⋮ Idiosynchromatic poetry ⋮ Independence in graphs with maximum degree four ⋮ Ramsey-Paris-Harrington numbers for graphs ⋮ An invariant for minimum triangle-free graphs
This page was built for publication: Some graph theoretic results associated with Ramsey's theorem
