Results 31 to 40 of about 21,615 (266)
In the first section of this paper it is shown that the bipartite Ramsey number br(m, n) satisfies br(m, n)⩽2m(n−1)+1. (Beineke and Schwenk [1] conjectured br(m, n) = 2m(n−1) + 1 but Irving [17] showed that equality does not always hold.) The second section gives a conjecture for the Ramsey numbers of the complete graphs, and lastly the numbers of ...
openaire +2 more sources
Ramsey and Gallai-Ramsey numbers for forests
Summary: Given two non-empty graphs \(G,H\) and a positive integer \(k\), the Gallai-Ramsey number \(\operatorname{gr}_k(G:H)\) is defined as the minimum integer \(N\) such that for all \(n\geq N\), every \(k\)-edge-coloring of \(K_n\) contains either a rainbow copy of \(G\) or a monochromatic copy of \(H\).
Yujia Gao +3 more
openaire +3 more sources
RAMSEY NUMBERS FOR TREES [PDF]
AbstractForn≥5, letT′ndenote the unique tree onnvertices with Δ(T′n)=n−2, and letT*n=(V,E) be the tree onnvertices withV={v0,v1,…,vn−1} andE={v0v1,…,v0vn−3,vn−3vn−2,vn−2vn−1}. In this paper, we evaluate the Ramsey numbersr(Gm,T′n) andr(Gm,T*n) , whereGmis a connected graph of orderm.
openaire +2 more sources
Critical Graphs for R(Pn, Pm) and the Star-Critical Ramsey Number for Paths
The graph Ramsey number R(G,H) is the smallest integer r such that every 2-coloring of the edges of Kr contains either a red copy of G or a blue copy of H.
Hook Jonelle
doaj +1 more source
On the restricted size Ramsey number for P3 versus dense connected graphs
Let F, G and H be simple graphs. A graph F is said a (G,H)-arrowing graph if in any red-blue coloring of edges of F we can find a red G or a blue H. The size Ramsey number of G and H, ŕ(G,H), is the minimum size of F.
Denny Riama Silaban +2 more
doaj +1 more source
Let \(TT_n\) denote the transitive tournament on \(n\) vertices and let \(D_1,D_2,\dots, D_k\) be acyclic digraphs. The ordered Ramsey number \(\rho(D_1,D_2,\dots, D_k)\) is the smallest integer \(n\) so that any \(k\)-coloring of the edges of \(TT_n\) admits, for some index \(i\), a copy of \(D_i\) with all of its edges colored with the \(i\)th color.
Sheshayya A. Choudum, B. Ponnusamy
openaire +1 more source
The Lupus Damage Index Revision Program: Results From the Item Generation and Reduction Phases
Objective A data‐driven and expert/patient consensus‐based project to develop a revised Systemic Lupus International Collaborating Clinics (SLICC)/American College of Rheumatology (ACR) Damage Index (SDI) is under way supported by SLICC, ACR, and the Lupus Foundation of America. Our objective is to report the item generation and reduction phase results
Burak Kundakci +25 more
wiley +1 more source
Diagonal Ramsey numbers in multipartite graphs related to stars
: Let the star on n vertices, namely K1, n − 1 be denoted by Sn. If every two coloring of the edges of a complete balanced multipartite graph Kj × s there is a copy of Sn in the first color or a copy of Sm in the second color, then we will say Kj × s ...
Chula Janak Jayawardene
doaj +1 more source
An STI‐guided metagenomic association framework links soybean salt‐tolerance phenotypes with rhizosphere microbiome composition and network organization in natural saline soils. The approach identifies candidate beneficial taxa, including Thalassospira xiamenensis, and provides an efficient strategy for mining stress‐protective microbes from native ...
Yu Luo +3 more
wiley +1 more source
For positive integers \(s\) and \(t\), the matroid Ramsey number \(n(s,t)\) is the least positive integer \(n\) such that every connected matroid with at least \(n\) elements has either a circuit with at least \(s\) elements or a cocircuit with at least \(t\) elements.
openaire +2 more sources

