Results 71 to 80 of about 6,576,413 (265)
Pairwise Imitation and Tournament Graphs
International Economic Review, EarlyView.ABSTRACT This paper investigates strategic dynamics under the behavioral rule of pairwise interact and imitate (PII), which requires minimal information and emphasizes outperforming opponents in pairwise interactions. We characterize PII using weak tournament graphs and, for a broad class of dynamics, establish a one‐shot stability result for ...
Sung‐Ha Hwang +3 more
wiley +1 more source
Solving Local Linear Systems with Boundary Conditions Using Heat Kernel Pagerank
, 2015 We present an efficient algorithm for solving local linear systems with a boundary condition using the Green's function of a connected induced subgraph related to the system.
Chung, Fan, Simpson, Olivia
core +1 more source
Chromatic number and regular subgraphs
Bulletin of the London Mathematical Society, EarlyView.Abstract In 1992, Erdős and Hajnal posed the following natural problem: Does there exist, for every r∈N$r\in \mathbb {N}$, an integer F(r)$F(r)$ such that every graph with chromatic number at least F(r)$F(r)$ contains r$r$ edge‐disjoint cycles on the same vertex set? We solve this problem in a strong form, by showing that there exist n$n$‐vertex graphs
Barnabás Janzer +2 more
wiley +1 more source
On bounding the difference between the maximum degree and the chromatic number by a constant
, 2016 We provide a finite forbidden induced subgraph characterization for the graph class $\varUpsilon_k$, for all $k \in \mathbb{N}_0$, which is defined as follows.
Schaudt, Oliver, Weil, Vera
core +1 more source
International Transactions in Operational Research, Volume 33, Issue 3, Page 1656-1677, May 2026.Abstract In graph‐restricted cooperative games, a group of agents, represented by the nodes of a graph, work together to make a profit. However, two agents can cooperate within a coalition only if they are connected by the graph in the coalition. Several allocation rules have been proposed for these games, but there is something in common in all of ...
Antonio C. Alarcón +2 more
wiley +1 more source
A note on the minimum rank of graphs with given dominating induced subgraph
The American Journal of CombinatoricsAn induced subgraph of a graph \(G\) is said to be dominating if every vertex of \(G\) is at distance at most one from this subgraph. We investigate pairs \((G, F)\) where \(F\) is a non-singular dominating induced subgraph of \(G,\) and the rank of \(G\
Zoran Stanić
doaj +1 more source
Subgraph Queries by Context-free Grammars
Journal of Integrative Bioinformatics, 2008 We describe a method for querying vertex- and edge-labeled graphs using context-free grammars to specify the class of interesting paths. We introduce a novel problem, finding the connection subgraph induced by the set of matching paths between given two ...
Sevon Petteri, Eronen Lauri
doaj +1 more source
Dense subgraphs induced by edge labels [PDF]
, 2023 Iiro Kumpulainen, Nikolaj Tatti
openalex +1 more source
Large induced degenerate subgraphs
Graphs and Combinatorics, 1987 A graph G is called d-degenerate (for a positive integer d), if every non-empty subgraph of G contains a vertex of degree smaller than d. The symbol \(\alpha_ d(G)\) denotes the maximum number of vertices of an induced d-degenerate subgraph of G. Further \(e_ d(n,m)\) is the minimum number of edges of a graph G with n vertices and with \(\alpha_ d(G)=m\
Alon, N., Kahn, J., Seymour, P. D.
openaire +2 more sources
Perfect Matching Under Precedence Constraints
Networks, Volume 87, Issue 2, Page 175-190, March 2026.ABSTRACT In this article, we motivate and define variants of perfect matching under precedence constraints where a perfect matching is built incrementally and precedence constraints ensure that an edge may only be added to the matching if the edge's predecessor vertices have already been covered.
Christina Büsing, Corinna Mathwieser
wiley +1 more source