Results 51 to 60 of about 247,409 (283)
Anti-Ramsey numbers for disjoint copies of graphs [PDF]
A subgraph of an edge-colored graph is called rainbow if all of its edges have different colors. For a graph \(G\) and a positive integer \(n\), the anti-Ramsey number \(ar(n,G)\) is the maximum number of colors in an edge-coloring of \(K_n\) with no ...
Izolda Gorgol, Agnieszka Görlich
doaj +1 more source
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
Objective To estimate the effect of time from symptom onset to start of biologic treatment on achieving inactive arthritis within six months in a cohort of patients with juvenile idiopathic arthritis (JIA). Methods The international UCAN CAN‐DU study prospectively enrolled patients with JIA across Canada and the Netherlands.
Jelleke B. de Jonge +102 more
wiley +1 more source
New directions in Ramsey theory [PDF]
Gary Chartrand, Ping Zhang
doaj +1 more source
21 pages ...
Nikiforov, Vladimir, Rousseau, Cecil
openaire +3 more sources
Objective Using a hydroxychloroquine (HCQ) dose of 5 mg/kg/day in systemic lupus erythematosus (SLE) is associated with a higher risk of flares; HCQ blood level monitoring could be a better way to adjust the HCQ dose. We studied the upper threshold for a reference range of HCQ levels to inform routine monitoring.
Shivani Garg +42 more
wiley +1 more source
Ramsey numbers R(K3,G) for graphs of order 10 [PDF]
In this article we give the generalized triangle Ramsey numbers R(K3,G) of 12 005 158 of the 12 005 168 graphs of order 10. There are 10 graphs remaining for which we could not determine the Ramsey number.
Brinkmann, Gunnar +2 more
core +2 more sources
Star-Critical Weakened Ramsey Numbers
The weakened Ramsey number $r^{s,t}(G)$ is defined to be the least $p\in \mathbb{N}$ such that every $t$-coloring of the edges of the complete graph $K_p$ contains a subgraph isomorphic to $G$ that is spanned by edges that use at most $s$ colors ($1\le s\
Mark Budden, Monu Moun, Jagjeet Jakhar
doaj +1 more source
Anti-Ramsey Number of Hanoi Graphs
Let ar(G,H) be the largest number of colors such that there exists an edge coloring of G with ar(G,H) colors such that each subgraph isomorphic to H has at least two edges in the same color. We call ar(G,H) the anti- Ramsey number for a pair of graphs (G,
Gorgol Izolda, Lechowska Anna
doaj +1 more source

