661 research outputs found
Sink-Stable Sets of Digraphs
We introduce the notion of sink-stable sets of a digraph and prove a min-max
formula for the maximum cardinality of the union of k sink-stable sets. The
results imply a recent min-max theorem of Abeledo and Atkinson on the Clar
number of bipartite plane graphs and a sharpening of Minty's coloring theorem.
We also exhibit a link to min-max results of Bessy and Thomasse and of Sebo on
cyclic stable sets
Sink-Stable Sets of Digraphs
We introduce the notion of sink-stable sets of a digraph and prove a min-max formula for the maximum cardinality of the union of k sink-stable sets. The results imply a recent min-max theorem of Abeledo and Atkinson on the Clar number of bipartite plane graphs and a sharpening of Minty’s coloring theorem. We also exhibit a link to min-max results of Bessy and Thomasse ́ and of Sebő on cyclic stable sets
Uniquely D-colourable digraphs with large girth
Let C and D be digraphs. A mapping is a C-colouring if for
every arc of D, either is an arc of C or , and the
preimage of every vertex of C induces an acyclic subdigraph in D. We say that D
is C-colourable if it admits a C-colouring and that D is uniquely C-colourable
if it is surjectively C-colourable and any two C-colourings of D differ by an
automorphism of C. We prove that if a digraph D is not C-colourable, then there
exist digraphs of arbitrarily large girth that are D-colourable but not
C-colourable. Moreover, for every digraph D that is uniquely D-colourable,
there exists a uniquely D-colourable digraph of arbitrarily large girth. In
particular, this implies that for every rational number , there are
uniquely circularly r-colourable digraphs with arbitrarily large girth.Comment: 21 pages, 0 figures To be published in Canadian Journal of
Mathematic
Induced subgraphs of graphs with large chromatic number. XI. Orientations
Fix an oriented graph H, and let G be a graph with bounded clique number and
very large chromatic number. If we somehow orient its edges, must there be an
induced subdigraph isomorphic to H? Kierstead and Rodl raised this question for
two specific kinds of digraph H: the three-edge path, with the first and last
edges both directed towards the interior; and stars (with many edges directed
out and many directed in). Aboulker et al subsequently conjectured that the
answer is affirmative in both cases. We give affirmative answers to both
questions
Opinion Dynamics in Heterogeneous Networks: Convergence Conjectures and Theorems
Recently, significant attention has been dedicated to the models of opinion
dynamics in which opinions are described by real numbers, and agents update
their opinions synchronously by averaging their neighbors' opinions. The
neighbors of each agent can be defined as either (1) those agents whose
opinions are in its "confidence range," or (2) those agents whose "influence
range" contain the agent's opinion. The former definition is employed in
Hegselmann and Krause's bounded confidence model, and the latter is novel here.
As the confidence and influence ranges are distinct for each agent, the
heterogeneous state-dependent interconnection topology leads to a
poorly-understood complex dynamic behavior. In both models, we classify the
agents via their interconnection topology and, accordingly, compute the
equilibria of the system. Then, we define a positive invariant set centered at
each equilibrium opinion vector. We show that if a trajectory enters one such
set, then it converges to a steady state with constant interconnection
topology. This result gives us a novel sufficient condition for both models to
establish convergence, and is consistent with our conjecture that all
trajectories of the bounded confidence and influence models eventually converge
to a steady state under fixed topology.Comment: 22 pages, Submitted to SIAM Journal on Control and Optimization
(SICON
- …