Results 111 to 120 of about 1,222,002 (199)
International Journal of Finance &Economics, Volume 31, Issue 4, Page 4741-4756, October 2026.ABSTRACT This paper examines the impact of trade liberalisation on income inequality across 24 Sub‐Saharan African (SSA) countries from 2000 to 2020. Using IV‐Tobit and 2SLS models, we consistently find that greater trade openness significantly exacerbates inequality in the region. Critically, we document an inverted U‐shaped relationship between trade
Guivis Zeufack Nkemgha +2 more
wiley +1 more source
Transaction Costs and the Robustness of the Coase Theorem [PDF]
This paper explores the extent to which the presence of ex-ante transaction costs may lead to failures of the Coase Theorem. In particular we identify and investigate the basic `hold-up problem' which arises whenever the parties to a Coasian negotiation ...
Luca Anderlini & Leonardo Felli
core
Lower Bounds for Maximum Weight Bisections of Weighted Triangle‐Free Subcubic Graphs
Journal of Graph Theory, Volume 113, Issue 2, Page 252-273, October 2026.ABSTRACT A bisection of a graph is a cut in which the number of vertices in the two parts of the cut differ by at most 1. In this paper, we consider maximum weight bisections of edge‐weighted triangle‐free subcubic graphs and show that every weighted triangle‐free subcubic graph G = ( V , E , w )
wiley +1 more source
On a Clique‐Building Game of Erdős
Journal of Graph Theory, Volume 113, Issue 2, Page 208-221, October 2026.ABSTRACT The following game was introduced in a list of open problems from 1983 attributed to Erdős: two players take turns claiming edges of a K n
Alexandru Malekshahian, Sam Spiro
wiley +1 more source
Robustness of the Sauer–Spencer Theorem
Random Structures &Algorithms, Volume 69, Issue 3, October 2026.ABSTRACT We prove a robust version of a graph embedding theorem of Sauer and Spencer. To state this sparser analogue, we define G(p)$$ G(p) $$ to be a random subgraph of G$$ G $$ obtained by retaining each edge of G$$ G $$ independently with probability p∈[0,1]$$ p\in \left[0,1\right] $$, and let m1(H)$$ {m}_1(H) $$ be the maximum 1‐density of a graph ...
Peter Allen +3 more
wiley +1 more source
Topics in Graph Theory: Extremal Intersecting Systems, Perfect Graphs, and Bireflexive Graphs
, 2020 In this thesis we investigate three different aspects of graph theory. Firstly, we consider interesecting systems of independent sets in graphs, and the extension of the classical theorem of Erdos, Ko and Rado to graphs.
Thomas, Daniel James Rhys
core
Theoretical estimates on the expected number of mutations needed to reconstruct clonal lineage trees. [PDF]
Bioinform AdvBristy NA, Schwartz R.
europepmc +1 more source
On the Local Resilience of Random Geometric Graphs With Respect to Connectivity and Long Cycles
Random Structures &Algorithms, Volume 69, Issue 3, October 2026.ABSTRACT Given an increasing graph property 𝒫, a graph G$$ G $$ is α$$ \alpha $$‐resilient with respect to 𝒫 if, for every spanning subgraph H⊆G$$ H\subseteq G $$ where each vertex keeps more than a (1−α)$$ \left(1-\alpha \right) $$‐proportion of its neighbors, H$$ H $$ has property 𝒫.
Alberto Espuny Díaz +2 more
wiley +1 more source
Space Weather, Volume 24, Issue 10, October 2026.Abstract This study develops and evaluates five deep learning models, including image‐based (CNN, SwinT) and video‐based (CNN‐LSTM, SwinT‐LSTM, Video SwinT), to forecast ≥ ${\ge} $M‐class flares within the next 24 hr using cross‐validation (CV) data sets.
Yongshang Lv +17 more
wiley +1 more source