Results 71 to 80 of about 1,298 (200)
Degree Ramsey theory, game and Roman domination, and game saturation in graphs [PDF]
"We examine several problems in extremal graph theory, emphasizing problems involving games on graphs. In Chapter 2, we study a variant of Ramsey theory, seeking Ramsey hosts with small maximum degree. We focus on finding such hosts for trees and cycles.
Kinnersley, William
core
Demographic Dynamics and International Trade: Stylized Facts and Theoretical Insights
ABSTRACT Demographic change within a country has economic repercussions for other countries through international transactions. Ongoing shifts in population size and age structure across countries have important implications for international trade, operating through changes in market size, consumption preferences, and labor supply.
Kumuthini Sivathas
wiley +1 more source
Strongly regular graphs and finite Ramsey theory
Some connections between strongly regular graphs and finite Ramsey theory are drawn. Let Bn denote the graph K2+K̄n. If there exists a strongly regular graph with parameters (υ, k, λ, μ), then the Ramsey number r(Bλ+1, Bυ−2k+μ −1)⩾υ+1.
Faudree, R.J. +2 more
core +1 more source
Generalized ramsey theory for graphs, x: double stars
AbstractThe double star S(n, m), where n ⩾ m ⩾ 0, is the graph consisting of the union of two stars K1,n and K1,m together with a line joining their centers. Its ramsey number r(S(n, m)) is the least number p such that there is a monochromatic copy of S(n, m) in any 2-coloring of the edges of Kp.
Grossman, Jerrold W. +2 more
openaire +2 more sources
ABSTRACT The paper examines the financial balances of the US economy. Government is the main borrower and households and the foreign sector the main lenders. Business net lending is minimal. The balances and their underlying transactions contradict the loanable funds theory and its “global savings glut” variation.
Michalis Nikiforos, Lance Taylor
wiley +1 more source
Extremal theory and bipartite graph-tree Ramsey numbers
The authors contribute to the extremal Ramsey theory on graphs. In particular Ramsey numbers for trees and bipartite graphs are upperbounded. Tecnical mechanism developed for proving the main result is interesting in its own right and seems to be useful for further researches.
Paul Erdös +3 more
openaire +1 more source
Enhancing Volatility Prediction: A Wavelet‐Based Hierarchical Forecast Reconciliation Approach
ABSTRACT Forecasting realized volatility (RV) has been widely studied, with numerous techniques developed to enhance predictive accuracy. Among these techniques, the use of RV decompositions based on intraday asset returns has been applied. However, the use of a frequency‐based decomposition, which provides unique insights into the dynamics of RV ...
Adam Clements, Ajith Perera
wiley +1 more source
Extremal graph theory: Ramsey-Turán numbers, chromatic thresholds, and minors
This dissertation investigates several questions in extremal graph theory and the theory of graph minors. It consists of three independent parts; the first two parts focus on questions motivated by Turan's Theorem and the third part investigates a ...
Lenz, John E.
core
ABSTRACT We prove that the Ramsey number R ( 5 , 5 ) is less than or equal to 46. The proof uses a combination of linear programming and checking a large number of cases by computer. All of the computational parts of the proof were independently implemented by both authors, with consistent results.
Vigleik Angeltveit, Brendan D. McKay
wiley +1 more source
The Ramsey theory of the universal homogeneous triangle-free graph [PDF]
The universal homogeneous triangle-free graph, constructed by Henson [A family of countable homogeneous graphs, Pacific J. Math. 38(1) (1971) 69–83] and denoted [Formula: see text], is the triangle-free analogue of the Rado graph. While the Ramsey theory of the Rado graph has been completely established, beginning with Erdős–Hajnal–Posá [Strong ...
openaire +3 more sources

