Results 151 to 160 of about 2,319,892 (295)

Evolutionary dynamics on a regular networked structured and unstructured multi‐population

International Journal of Robust and Nonlinear Control, EarlyView., 2023
Abstract In this paper, we study collective decision‐making in a multi‐population framework, where groups of individuals represent whole populations that interact by means of a regular network. Each group consists of a number of players and every player can choose between two options.
Wouter Baar, Leonardo Stella, Dario Bauso   +2 more
wiley   +1 more source

The Strong Nash‐Williams Orientation Theorem for Rayless Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT In 1960, Nash‐Williams proved his strong orientation theorem that every finite graph has an orientation in which the number of arc‐disjoint directed paths between any two vertices is at least half the number of undirected edge‐disjoint paths between them (rounded down).
Max Pitz, Jacob Stegemann
wiley   +1 more source

On Sparsity Conditions Guaranteeing a Fractional Coloring

Journal of Graph Theory, EarlyView.
ABSTRACT A graph has an ( a : b ) $(a:b)$ ‐coloring if there exists an assignment from the vertices to subsets of { 1 , … , a } $\{1,\ldots ,a\}$ with size b $b$ such that adjacent vertices are assigned disjoint subsets. Odd girth at least 2 k + 1 $2k+1$ is a necessary condition for a graph to have a ( 2 k + 1 : k ) $(2k+1:k)$‐coloring.
Ilkyoo Choi
wiley   +1 more source

The Temporal Derivative of Selection: A Lemma on the Equivalence of Gödelian Incompleteness and the Axiom of Choice

This paper resolves the long-standing independence of the Axiom of Choice (AC) by deriving it as a mandatory structural necessity of Time-Cadence. We demonstrate that AC and Gödel’s Incompleteness Theorems are functionally equivalent when viewed through a temporal lens.
openaire   +2 more sources

Maximal Minimal Spacing for Random Points. [PDF]

J Stat Phys
Cunden FD, Cuppone N, Gramegna G, Vivo P.   +3 more
europepmc   +1 more source

Saturated Partial Embeddings of Planar Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT In this work, we study how far one can deviate from optimal behavior when embedding a planar graph. For a planar graph G $G$, we say that a plane subgraph H ⊆ G $H\subseteq G$ is a plane‐saturated subgraph if adding any edge (possibly with new vertices) to H $H$ would either violate planarity or make the resulting graph no longer a subgraph of
Alexander Clifton, Nika Salia
wiley   +1 more source

A two-species competition model on a compact metric graph for the invasion and competition of Aedes Aegypti and Aedes Albopictus mosquitoes in Florida. [PDF]

J Math Biol
Tian C, Zou L, Ruan S.
europepmc   +1 more source

Equivalent Formulation of Thomassen's Conjecture Using Tutte Paths in Claw‐Free Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT We continue studying Thomassen's conjecture (every 4‐connected line graph has a Hamilton cycle) in the direction of a recently shown equivalence with Jackson's conjecture (every 2‐connected claw‐free graph has a Tutte cycle), and we extend the equivalent formulation as follows: In every connected claw‐free graph, any two vertices are connected
Adam Kabela, Zdeněk Ryjáček, Petr Vrána   +2 more
wiley   +1 more source

Maximal Dissipation and Well-Posedness of the Euler System of Gas Dynamics. [PDF]

Arch Ration Mech Anal
Feireisl E, Jüngel A, Lukáčová-Medvid'ová M.   +2 more
europepmc   +1 more source

Qualità e Sicurezza negli edifici

, 2008
Parlare di qualità certo non sorprende; è un termine consueto, anche se spesso utilizzato in modo non aderente agli scopi che la politica per la qualità si prefigge.
LEMMA, Massimo
core