Results 41 to 50 of about 9,500 (263)
The linear arboricity of a graph \(G\) is the least integer \(m\) such that the vertex set \(V(G)\) can be partitioned into \(m\) sets, each inducing a linear forest, i.e. a forest in which every component is a path. Let \(H\) be a connected graph on \(n\) vertices such that \(V(H)\) can be covered by \(t\) (and no fewer) vertex-disjoint paths in the ...
Baogen Xu, Zhongfu Zhang
openaire +1 more source
ABSTRACT Brazil and the United States account for more than 40% of global poultry exports, with China and South Korea among their major destination markets. This study examines price transmission and market linkages between Brazil and the United States using monthly poultry export price data from January 1990 to December 2024. It also assesses which of
Khondoker Abdul Mottaleb +2 more
wiley +1 more source
On size multipartite Ramsey numbers for stars
Burger and Vuuren defined the size multipartite Ramsey number for a pair of complete, balanced, multipartite graphs mj(Kaxb,Kcxd), for natural numbers a,b,c,d and j, where a,c >= 2, in 2004.
Anie Lusiani +2 more
doaj +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
Summary: The planar Ramsey number \(\text{PR}(G, H)\) is defined as the smallest integer \(n\) for which any 2-colouring of the edges of \(K_n\) with red and blue, where red edges induce a planar graph, leads to either a red copy of \(G\), or a blue copy of \(H\).
openaire +1 more source
Genomics is modifying our concepts of evolution in homosporous and heterosporous vascular plants
Abstract Across the tree of life, and particularly within land plants, there is a wide diversity and disparity of genome structure. The most well‐studied are angiosperms, comprising mostly small and dynamic genomes, with a history of ancient whole genome duplications.
Sylvia P. Kinosian
wiley +1 more source
Weakened Gallai-Ramsey numbers [PDF]
In the Ramsey theory of graphs, one seeks to determine the value of the Ramsey number rt(n), defined to be the least natural number p such that every coloring of the edges of Kp using t colors results in a monochromatic copy of Kn in some color.
Gabrielle Beam, Mark Budden
doaj
Colored complete hypergraphs containing no rainbow Berge triangles
The study of graph Ramsey numbers within restricted colorings, in particular forbidding a rainbow triangle, has recently been blossoming under the name Gallai-Ramsey numbers.
Colton Magnant
doaj +1 more source
AbstractWe introduce a list‐coloring extension of classical Ramsey numbers. We investigate when the two Ramsey numbers are equal, and in general, how far apart they can be from each other. We find graph sequences where the two are equal and where they are far apart.
Noga Alon +4 more
openaire +5 more sources
Objective Methotrexate (MTX) is the first‐line therapy for juvenile idiopathic arthritis (JIA), but up to 40% of patients do not respond to it. Low inosine triphosphate pyrophosphatase (ITPA) activity has been associated with reduced clinical remission. We investigated the role and underlying mechanisms of ITPA in vitro. Methods ITPA enzymatic activity
Sofia Sindici Forgiarini +19 more
wiley +1 more source

