Three Early Problems on Size Ramsey Numbers
نویسندگان
چکیده
The size Ramsey number of a graph H is defined as the minimum edges in G such that there monochromatic copy every two-coloring E(G). was introduced by Erdős, Faudree, Rousseau, and Schelp 1978 they ended their foundational paper asking whether one can determine up to constant factor numbers three families graphs: complete bipartite graphs, book graphs (obtained adding many common neighbors vertices clique), starburst pendant each vertex clique). In this paper, we completely resolve latter two questions make substantial progress on first determining $$K_{s,t}$$ for all $$t =\Omega (s\log s)$$ .
منابع مشابه
On Some Three-Color Ramsey Numbers
In this paper we study three-color Ramsey numbers. Let Ki,j denote a complete i by j bipartite graph. We shall show that (i) for any connected graphs G1, G2 and G3, if r(G1, G2) ≥ s(G3), then r(G1, G2, G3) ≥ (r(G1, G2) − 1)(χ(G3) − 1) + s(G3), where s(G3) is the chromatic surplus of G3; (ii)(k + m − 2)(n − 1) + 1 ≤ r(K1,k,K1,m,Kn) ≤ (k + m − 1)(n − 1) + 1, and if k or m is odd, the second inequ...
متن کاملThree Results on Cycle-Wheel Ramsey Numbers
Given twographsG1 andG2, theRamseynumber R(G1,G2) is the smallest integer N such that, for any graph G of order N , either G1 is a subgraph of G, or G2 is a subgraph of the complement of G. We consider the case that G1 is a cycle and G2 is a (generalized) wheel. We expand the knowledge on exact values of Ramsey numbers in three directions: large cycles versus wheels of odd order; large wheels v...
متن کاملSize and Degree Anti-Ramsey Numbers
A copy of a graph H in an edge colored graph G is called rainbow if all edges of H have distinct colors. The size anti-Ramsey number of H, denoted by ARs(H), is the smallest number of edges in a graph G such that any of its proper edge-colorings contains a rainbow copy of H. We show that ARs(Kk) = Θ(k / log k). This settles a problem of Axenovich, Knauer, Stumpp and Ueckerdt. The proof is proba...
متن کاملRamsey Numbers and the Size of Graphs
For two graph H and G, the Ramsey number r(H,G) is the smallest positive integer n such that every red-blue edge coloring of the complete graph Kn on n vertices contains either a red copy of H or a blue copy of G. Motivated by questions of Erdős and Harary, in this note we study how the Ramsey number r(Ks, G) depends on the size of the graph G. For s ≥ 3, we prove that for every G with m edges,...
متن کاملZarankiewicz Numbers and Bipartite Ramsey Numbers
The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or a Kt,t in the second color.In this work, we design and exploit a computational method for bounding and computing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 2023
ISSN: ['0209-9683', '1439-6912']
DOI: https://doi.org/10.1007/s00493-023-00034-7