Results 61 to 70 of about 9,500 (263)
Discrete Mathematics, 1980 AbstractWe consider the Ramsey number r(sK2, G) where sK2(s⩾1) denotes a set of s disjoint edges and G is an arbitrary finite simple graph with no isolated vertices. We obtain upper and lower bounds in the general case. Exact results are obtained for certain classes of graphs.
Ralph J. Faudree +2 more
openaire +1 more source
On weighted Ramsey numbers [PDF]
Australas. J Comb., 2007 15 ...
Maria Axenovich, Ryan R. Martin
openaire +2 more sources
Moderate Amylose Increases From SSIIa Mutations Modify Pasta Texture in Durum Wheat
Cereal Chemistry, EarlyView.ABSTRACT Background and Objectives Durum wheat (Triticum turgidum L. subsp. durum) pasta quality depends on grain yellowness, gluten strength, and protein content, and can be modified by altering starch composition. High‐amylose null mutants improve nutritional traits but often reduce seed size, yield, and processing quality.
Prashant Kumar +3 more
wiley +1 more source
The m-bipartite Ramsey number of the K2,2 versus K6,6 [PDF]
Contributions to Mathematics, 2022 Yaser Rowshan
doaj +1 more source
Clinical Pharmacology &Therapeutics, EarlyView.The NAT2 pharmacogene is essential in drug metabolism, particularly for aromatic amines and hydrazines. Genetic variations in NAT2 categorize individuals as rapid, intermediate, or poor metabolizers based on their acetylation capacity to inform dosing guidelines.
Shobana John +4 more
wiley +1 more source
The bipartite Ramsey numbers $BR(C_8, C_{2n})$ [PDF]
Discrete Mathematics & Theoretical Computer ScienceFor the given bipartite graphs $G_1,G_2,\ldots,G_t$, the multicolor bipartite Ramsey number $BR(G_1,G_2,\ldots,G_t)$ is the smallest positive integer $b$ such that any $t$-edge-coloring of $K_{b,b}$ contains a monochromatic subgraph isomorphic to $G_i ...
Mostafa Gholami, Yaser Rowshan
doaj +1 more source
Discrete Applied Mathematics, 2009 The graph \(F_n = K_1 + nK_2\) is the Fan graph, and consists of \(n\) triangles sharing a single vertex. It was shown in [\textit{Y. Li} and \textit{C.C. Rousseau}, J. Graph Theory 23, No.\,4, 413--420 (1996; Zbl 0954.05031)] that the Ramsey number \(r(F_1, F_n) = 4n + 1\) for \(n \geq 2\), and this result is extended by showing that \(r(F_2, F_n ...
Qizhong Lin, Yusheng Li 0001
openaire +1 more source
Negative learning emotions and learning goal orientation in teams: HRD implications
Human Resource Development Quarterly, Volume 36, Issue 1, Page 49-67, Spring 2025.Abstract Utilizing insights from team regulation theory and social cognitive theory, this research conducted empirical testing through a field survey involving engineering teams. This research is significant as it inspires teams to effectively harness their learning capacity, thereby enhancing collective motivation for future success.
Kuang‐Jung Chen +3 more
wiley +1 more source
Another View of Bipartite Ramsey Numbers
Discussiones Mathematicae Graph Theory, 2018 For bipartite graphs F and H and a positive integer s, the s-bipartite Ramsey number BRs(F,H) of F and H is the smallest integer t with t ≥ s such that every red-blue coloring of Ks,t results in a red F or a blue H.
Bi Zhenming, Chartrand Gary, Zhang Ping
doaj +1 more source
Bipartite Ramsey numbers involving stars, stripes and trees
Electronic Journal of Graph Theory and Applications, 2013 The Ramsey number R(m, n) is the smallest integer p such that any blue-red colouring of the edges of the complete graph Kp forces the appearance of a blue Km or a red Kn.
Michalis Christou +2 more
doaj +1 more source