Results 51 to 60 of about 1,298 (200)
Monochromatic triangles in three-coloured graphs [PDF]
In 1959, Goodman [9] determined the minimum number of monochromatic triangles in a complete graph whose edge set is 2-coloured. Goodman (1985) [10] also raised the question of proving analogous results for complete graphs whose edge sets are coloured ...
Král', D. +16 more
core +1 more source
Chromatic Ramsey Numbers and Two‐Color Turán Densities
ABSTRACT Given a graph G, its 2‐color Turán number ex ( 2 ) ( n , G ) is the maximum number of edges in an n‐vertex graph, such that the edges can be colored with two colors avoiding a monochromatic copy of G. Let π ( 2 ) ( G ) = lim n → ∞ ex ( 2 ) ( n , G ) / n 2 be the 2‐color Turán density of G.
Maria Axenovich, Simon Gaa, Dingyuan Liu
wiley +1 more source
This BCs thesis deals with topics from graph theory. Ramsey theory in its most basic form deals with the problem of determining the minimal positive integer, such that for any edge-coloring of the complete graph of this size with a prescribed number of ...
Hočevar, Mitja
core
Tree Independence Number III. Thetas, Prisms and Stars
ABSTRACT We prove that for every t ∈ N $t\in {\mathbb{N}}$ there exists τ = τ ( t ) ∈ N $\tau =\tau (t)\in {\mathbb{N}}$ such that every (theta, prism, K 1 , t ${K}_{1,t}$)‐free graph has tree independence number at most τ $\tau $ (where we allow “prisms” to have one path of length zero).
Maria Chudnovsky +2 more
wiley +1 more source
This thesis presents various types of results from Ramsey Theory, most particularly, Ramsey-type theorems concerning graphs and families of sets. This thesis consists of 8 chapters.
Chng, Zhi Yee
core +1 more source
Biodiversity is threatened by human activities, with extinction debt accumulating rapidly. Many of these activities change the connectivity of populations, fragmenting existing population systems or bringing previously isolated populations or species into contact.
Zhiqin Long +7 more
wiley +1 more source
Generalized Ramsey theory for graphs XII: Bipartite Ramsey sets [PDF]
Following the notation in Faudree and Schelp [3], we write G → (F, H) to mean that every 2-coloring of E(G), the edge set of G, contains a green (the first color) F or a red (the second color) H. Then the Ramsey number r(F, H) of two graphs F and H with no isolated vertices has been defined as the minimum p such that Kp → (F, H).
Harary, Frank +2 more
openaire +1 more source
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
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
Tracking SDG‐7 in China, India, and Japan
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

