Results 21 to 30 of about 21,615 (266)
A note on the Ramsey number for cycle with respect to multiple copies of wheels
Electronic Journal of Graph Theory and Applications, 2021 Let Kn be a complete graph with n vertices. For graphs G and H, the Ramsey number R(G, H) is the smallest positive integer n such that in every red-blue coloring on the edges of Kn, there is a red copy of graph G or a blue copy of graph H in Kn ...
I Wayan Sudarsana
doaj +1 more source
A note on the size Ramsey numbers for matchings versus cycles [PDF]
Mathematica Bohemica, 2021 For graphs $G$, $F_1$, $F_2$, we write $G \rightarrow(F_1, F_2)$ if for every red-blue colouring of the edge set of $G$ we have a red copy of $F_1$ or a blue copy of $F_2$ in $G$.
Edy Tri Baskoro, Tomáš Vetrík
doaj +1 more source
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2022 We initiate the study of Ramsey numbers of trails. Let $k \geq 2$ be a positive integer. The Ramsey number of trails with $k$ vertices is defined as the the smallest number $n$ such that for every graph $H$ with $n$ vertices, $H$ or the complete $\overline{H}$ contains a trail with $k$ vertices.
openaire +2 more sources
Restricted size Ramsey number for path of order three versus graph of order five
Electronic Journal of Graph Theory and Applications, 2017 Let $G$ and $H$ be simple graphs. The Ramsey number for a pair of graph $G$ and $H$ is the smallest number $r$ such that any red-blue coloring of edges of $K_r$ contains a red subgraph $G$ or a blue subgraph $H$.
Denny Riama Silaban +2 more
doaj +1 more source
Star-Critical Ramsey Numbers for Cycles Versus K4
Discussiones Mathematicae Graph Theory, 2021 Given three graphs G, H and K we write K → (G, H), if in any red/blue coloring of the edges of K there exists a red copy of G or a blue copy of H. The Ramsey number r(G, H) is defined as the smallest natural number n such that Kn → (G, H) and the star ...
Jayawardene Chula J. +2 more
doaj +1 more source
Ramsey numbers for tournaments
Theoretical Computer Science, 2001 Let \(D_1,\dots, D_k\) be acyclic digraphs (possibly several are isomorphic). The authors define the \(k\)-color Ramsey number \(r(D_1,\dots, D_k)\) as the largest integer \(r\) for which there exists a tournament \(T= (V,A)\) on \(r\) vertices and a \(k\)-coloring \(\phi: A\to \{1,\dots, k\}\) of its arc set such that no \(D_i\) is a subdigraph of \(T\
Yannis Manoussakis, Zsolt Tuza
openaire +2 more sources
On a Variation of the Ramsey Number [PDF]
Transactions of the American Mathematical Society, 1972 Let c ( m , n ...
Chartrand, Gary, Schuster, Seymour
openaire +1 more source
Generalization of Ramsey Number for Cycle with Pendant Edges
MathematicsThis paper explores various Ramsey numbers associated with cycles with pendant edges, including the classical Ramsey number, the star-critical Ramsey number, the Gallai–Ramsey number, and the star-critical Gallai–Ramsey number.
Jagjeet Jakhar +5 more
doaj +1 more source