22,193 research outputs found
3-Factor-criticality in double domination edge critical graphs
A vertex subset of a graph is a double dominating set of if
for each vertex of , where is the set of the
vertex and vertices adjacent to . The double domination number of ,
denoted by , is the cardinality of a smallest double
dominating set of . A graph is said to be double domination edge
critical if for any edge . A double domination edge critical graph with is called --critical. A graph is
-factor-critical if has a perfect matching for each set of
vertices in . In this paper we show that is 3-factor-critical if is
a 3-connected claw-free --critical graph of odd order
with minimum degree at least 4 except a family of graphs.Comment: 14 page
Coupling and Bernoullicity in random-cluster and Potts models
An explicit coupling construction of random-cluster measures is presented. As
one of the applications of the construction, the Potts model on amenable Cayley
graphs is shown to exhibit at every temperature the mixing property known as
Bernoullicity
Rainbow domination and related problems on some classes of perfect graphs
Let and let be a graph. A function is a rainbow function if, for every vertex with
, . The rainbow domination number
is the minimum of over all rainbow
functions. We investigate the rainbow domination problem for some classes of
perfect graphs
Random interlacements and amenability
We consider the model of random interlacements on transient graphs, which was
first introduced by Sznitman [Ann. of Math. (2) (2010) 171 2039-2087] for the
special case of (with ). In Sznitman [Ann. of Math.
(2) (2010) 171 2039-2087], it was shown that on : for any
intensity , the interlacement set is almost surely connected. The main
result of this paper says that for transient, transitive graphs, the above
property holds if and only if the graph is amenable. In particular, we show
that in nonamenable transitive graphs, for small values of the intensity u the
interlacement set has infinitely many infinite clusters. We also provide
examples of nonamenable transitive graphs, for which the interlacement set
becomes connected for large values of u. Finally, we establish the monotonicity
of the transition between the "disconnected" and the "connected" phases,
providing the uniqueness of the critical value where this transition
occurs.Comment: Published in at http://dx.doi.org/10.1214/12-AAP860 the Annals of
Applied Probability (http://www.imstat.org/aap/) by the Institute of
Mathematical Statistics (http://www.imstat.org
- …