
تعداد نشریات | 162 |
تعداد شمارهها | 6,693 |
تعداد مقالات | 72,239 |
تعداد مشاهده مقاله | 129,214,194 |
تعداد دریافت فایل اصل مقاله | 102,042,689 |
Zarankiewicz Numbers and Bipartite Ramsey Numbers | ||
Journal of Algorithms and Computation | ||
مقاله 7، دوره 47، شماره 1، شهریور 2016، صفحه 63-78 اصل مقاله (364.87 K) | ||
نوع مقاله: Research Paper | ||
شناسه دیجیتال (DOI): 10.22059/jac.2016.7943 | ||
نویسندگان | ||
Alex F. Collins* 1؛ Alexander W. N. Riasanovsky2؛ John C. Wallace3؛ Stanis law P. Radziszowski4 | ||
1Rochester Institute of Technology, School of Mathematical Sciences, Rochester, NY 14623 | ||
2University of Pennsylvania, Department of Mathematics, Philadelphia, PA 19104, USA | ||
3Trinity College, Department of Mathematics, Hartford, CT 06106, USA | ||
4Rochester Institute of Technology, Department of Computer Science, Rochester, NY 14623 | ||
چکیده | ||
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 Zarankiewicz numbers. Using it, we obtain several new values and bounds on z(b; s) for 3≤s≤6. Our approach and new knowledge about z(b; s) permit us to improve some of the results on bipartite Ramsey numbers obtained by | ||
کلیدواژهها | ||
Zarankiewicz number؛ bipartite Ramsey number | ||
آمار تعداد مشاهده مقاله: 1,068 تعداد دریافت فایل اصل مقاله: 770 |