Results 91 to 100 of about 9,500 (263)
FinTech and Environmental Sustainability: Evidence From Brazil
Sustainable Development, EarlyView.ABSTRACT This study explores the dynamic interplay between economic growth and environmental sustainability from a FinTech perspective, using Brazil as a case study. While FinTech's contribution to green transformation, sustainable finance, and resource efficiency has gained increasing attention, a notable lack of empirical research remains to assess ...
Kemal Eyuboglu, Umut Uzar
wiley +1 more source
The Electronic Journal of Combinatorics, 2011 We present data which, to the best of our knowledge, includes all known nontrivial values and bounds for specific graph, hypergraph and multicolor Ramsey numbers, where the avoided graphs are complete or complete without one edge. Many results pertaining to other more studied cases are also presented.
openaire +2 more sources
Energy Poverty and Climate Shocks: Are Changing Weather Patterns Leaving South Africa in the Dark?
Sustainable Development, EarlyView.ABSTRACT Energy and climate change are deeply interlinked, with the latter exerting significant influence on energy demand and supply. In regions such as South Africa, where socio‐economic vulnerability is high, understanding how climate change affects energy poverty is essential to achieving the Sustainable Development Goals, particularly SDG 7 ...
WiZelle Kritzinger, Roula Inglesi‐Lotz
wiley +1 more source
Sustainable Development, EarlyView.ABSTRACT Identifying the principal drivers of carbon emissions is vital for designing effective mitigation strategies and supporting long‐term environmental sustainability. Although previous studies have explored multiple determinants of emissions, limited attention has been paid to the most influential energy–technology channels within trade‐dependent
Gang Kou +3 more
wiley +1 more source
Computational Lower Bounds for Wheel Ramsey Numbers
MathematicsWe study small off-diagonal Ramsey numbers involving wheel graphs. Following Radziszowski’s convention, we write Wn=K1+Cn−1 for the wheel on n vertices. A lower bound for R(Wm,Wn) is certified by a graph G such that G is Wm-free and G¯ is Wn-free.
Sergey Bereg
doaj +1 more source
Avoiding rainbow 2-connected subgraphs
Open Mathematics, 2017 While defining the anti-Ramsey number Erdős, Simonovits and Sós mentioned that the extremal colorings may not be unique. In the paper we discuss the uniqueness of the colorings, generalize the idea of their construction and show how to use it to ...
Gorgol Izolda
doaj +1 more source
Sustainable Development, EarlyView.ABSTRACT This study explores the dynamic influence of income inequality on environmental quality in Malaysia and offers evidence‐based recommendations for climate action and policy. Using annual data from 1990 to 2022, the analysis utilizes the Stochastic Impacts by Regression on Population, Affluence, and Technology (STIRPAT) framework combined with ...
Masahina Sarabdeen +3 more
wiley +1 more source
Size multipartite Ramsey numbers for stripes versus small cycles
Electronic Journal of Graph Theory and Applications, 2016 For simple graphs $G_1$ and $G_2$, the size Ramsey multipartite number $m_j(G_1, G_2)$ is defined as the smallest natural number $s$ such that any arbitrary two coloring of the graph $K_{j \times s}$ using the colors red and blue, contains a red $G_1$ or
Chula Janak Jayawardene +3 more
doaj +1 more source
Tracking SDG‐7 in China, India, and Japan
Sustainable Development, EarlyView.ABSTRACT This study examines the impact of clean energy consumption on environmental quality, supporting the UN Sustainable Development Goal (SDG) 7, which aims to ensure access to clean, affordable energy for all. The Auto‐Regressive Distributed Lag (ARDL) model is used for Japan, and the Fourier ARDL for China and India, followed by a Granger ...
Arvind Goswami +3 more
wiley +1 more source
Discrete Mathematics, 1978 AbstractA graph G is totally connected if both G and Ḡ (its complement) are connected. The connected Ramsey number rc(F, H) is the smallest integer k ⩾ 4 so that if G is a totally connected graph of order k then either F ⊂ G or H ⊂ Ḡ. We show that if neither of F nor H contains a bridge, then rc = r(F, H), the usual generalized Ramsey number of F and H.
openaire +1 more source