Results 41 to 50 of about 248,095 (281)
Ramsey numbers and adiabatic quantum computing
The graph-theoretic Ramsey numbers are notoriously difficult to calculate. In fact, for the two-color Ramsey numbers $R(m,n)$ with $m,n\geq 3$, only nine are currently known. We present a quantum algorithm for the computation of the Ramsey numbers $R(m,n)
A. Y. Kitaev +9 more
core +1 more source
The Ramsey number \(R(P_n, K_1 + P_m)\) is determined for various ranges of \(n\) and \(m\), where \(P_n\) is a path with \(n\) vertices, and \(K_1 + P_m\) is the graph obtained from a path \(P_m\) by adding an additional vertex that is adjacent to all of the vertices of the path.
Salman, M., Broersma, Haitze J.
openaire +3 more sources
Cost Pass‐Through in Crisis: Evidence From the German Malt‐Beer Supply Chain
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
A note on the Ramsey numbers for theta graphs versus the wheel of order 5
The study of exact values and bounds on the Ramsey numbers of graphs forms an important family of problems in the extremal graph theory. For a set of graphs S and a graph F , the Ramsey number R (S , F) is the smallest positive integer r such that for ...
Mohammed M.M. Jaradat +3 more
doaj +2 more sources
Optimization of Operation Parameters in a Cesium Atomic Fountain Clock Using Monte Carlo Method
Number of detected atoms and contrast of Ramsey fringe are critical operation parameters in an atomic fountain clock. To optimize these operation parameters, a Monte Carlo method is utilized to simulate the evolution of the atomic cloud. It is found that
Hui Li +7 more
doaj +1 more source
On the Geometric Ramsey Number of Outerplanar Graphs
We prove polynomial upper bounds of geometric Ramsey numbers of pathwidth-2 outerplanar triangulations in both convex and general cases. We also prove that the geometric Ramsey numbers of the ladder graph on $2n$ vertices are bounded by $O(n^{3})$ and $O(
Cibulka, Josef +4 more
core +1 more source
For a graph-theoretic parameter \(f\), an integer \(m\) and a graph \(H\), the mixed Ramsey number \(v(f;m;H)\) is the least positive integer \(p\) such that if \(G\) is any graph of order \(p\), then either \(f(G) \geq m\) or \(\overline G\) contains a subgraph isomorphic to \(H\).
Achuthan, Nirmala +2 more
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
The Vertex-Disjoint and Edge-Disjoint Ramsey Numbers of a Set of Graphs
The 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
Noise assisted Ramsey interferometry
I analyze a metrological strategy for improving the precision of frequency estimation via Ramsey interferometry with strings of atoms in the presence of correlated dephasing.
Dorner, U.
core +1 more source

