Results 41 to 50 of about 21,615 (266)
Discrete Mathematics, 2002 The induced Ramsey number \(\text{IR}(G,H)\) is the smallest integer \(n\) for which there exists a graph \(F\) on \(n\) vertices such that any 2-colouring of its edges in red and blue produces either or both of a copy of a graph \(G\) induced in \(F\) with all of its edges red, or a copy of a graph \(H\) induced in \(F\) with all of its edges blue.
Izolda Gorgol, Tomasz Luczak 0001
openaire +1 more source
Cost Pass‐Through in Crisis: Evidence From the German Malt‐Beer Supply Chain
Agribusiness, EarlyView.Abstract Global agri‐food supply chains are increasingly exposed to geopolitical shocks, climate volatility, and market consolidation, factors that disrupt traditional price relationships and reshape market power dynamics. Nowhere is this more visible than in the brewing sector, where agricultural raw materials meet complex industrial processing and ...
Nikolas Bublik, Lukáš Čechura
wiley +1 more source
Discrete Mathematics, 1999 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
Agribusiness, EarlyView.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
The Vertex-Disjoint and Edge-Disjoint Ramsey Numbers of a Set of Graphs
AxiomsThe Ramsey number R(F) of a graph F without isolated vertices is the smallest positive integer n such that every red–blue coloring of Kn produces a subgraph isomorphic to F all of whose edges are colored the same.
Emma Jent, Ping Zhang
doaj +1 more source
Discussiones Mathematicae Graph Theory, 2005 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
American Journal of Botany, EarlyView.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
New directions in Ramsey theory [PDF]
Discrete Mathematics Letters, 2021 Gary Chartrand, Ping Zhang
doaj +1 more source
Strong Ramsey Numbers of Graphs of Size 4
MathematicsThe Ramsey number R(G) of a graph G without isolated vertices is the minimum order n of the complete graph Kn for which every red-blue edge coloring results in a monochromatic subgraph isomorphic to G.
Gary Chartrand, Ping Zhang
doaj +1 more source
Journal of Graph Theory, 2020 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