Results 81 to 90 of about 1,298 (200)
Treewidth Versus Clique Number. V. Further Connections With Tree‐Independence Number
ABSTRACT We continue the study of ( tw , ω )‐bounded graph classes, that is, hereditary graph classes in which large treewidth is witnessed by the presence of a large clique, and the relation of this property to boundedness of the tree‐independence number, a graph parameter introduced independently by Yolov in 2018 and by Dallard, Milanič, and Štorgel ...
Claire Hilaire +2 more
wiley +1 more source
Some problems in Graph Ramsey Theory
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2015.This electronic version was submitted by the student author.
Grinshpun, Andrey Vadim
core
Sentience in cephalopod molluscs: an updated assessment
ABSTRACT This article evaluates the evidence for sentience – the capacity to have feelings – in cephalopod molluscs: octopus, cuttlefish, squid, and nautilus. Our framework includes eight criteria, covering both whether the animal's nervous system could support sentience and whether their behaviour indicates sentience.
Alexandra K. Schnell +4 more
wiley +1 more source
When ecological data are collected by many entities for different purposes, they can be difficult to locate and integrate; web applications can address this by standardizing submission, automating cleaning, and incentivizing contributions. We present P.I.
Alex W. Bajcz +6 more
wiley +1 more source
How Regulation and Global Standing Shape Stock Market Co‐Movements: A G20 Panel Study
ABSTRACT Motivated by post‐2020 fragmentation and underexplored institutional‐geopolitical drivers, we examine how regulatory quality (RQ) and global power (GP) shape stock‐market co‐movements across 17 G20 economies. We estimate time‐varying correlations via ADCC‐GARCH, construct a scaled correlation index, and apply panel ARDL. We find that higher RQ
Sama Haddad +4 more
wiley +1 more source
Monochromatic Graph Decompositions Inspired by Anti-Ramsey Theory and Parity Constraints
We open here many new tracks of research in anti-Ramsey Theory, considering edge-coloring problems inspired by rainbow coloring and further by odd colorings and conflict-free colorings. Let G be a graph and F any given family of graphs. For every integer
Yair Caro, Zsolt Tuza
doaj +1 more source
The size-Ramsey number of powers of paths
Given graphs G and H and a positive integer q, say that G is q-Ramsey for H, denoted G → (H) q , if every q-coloring of the edges of G contains a monochromatic copy of H.
Morrison, Natasha +6 more
core
The Ramsey number $R(r, b)$ is the least positive integer such that every edge 2-coloring of the complete graph $K_{R(r, b)}$ with colors red and blue either embeds a red $K_r$ or a blue $K_b$. We explore various methods to find lower bounds on $R(r,b)$,
Lai, David
core +1 more source
An exploration in Ramsey theory
We present several introductory results in the realm of Ramsey Theory, a subfield of Combinatorics and Graph Theory. The proofs in this thesis revolve around identifying substructure amidst chaos.
Weber, Jake
core
A multidimensional Ramsey theorem
A multidimensional Ramsey theorem, Discrete Analysis 2024:21, 10 pp. Ramsey's theorem, the founding result of Ramsey theory, states that for every pair of positive integers $r$ and $k$ there exists $n$ such that if the edges of the complete graph $K_n ...
Antonio Girão +2 more
doaj +1 more source

