7,492 research outputs found
Symmetric Bipartite Graphs and Graphs with Loops
We show that if the two parts of a finite bipartite graph have the same
degree sequence, then there is a bipartite graph, with the same degree
sequences, which is symmetric, in that it has an involutive graph automorphism
that interchanges its two parts. To prove this, we study the relationship
between symmetric bipartite graphs and graphs with loops.Comment: arXiv admin note: substantial text overlap with arXiv:1302.365
Dimers and cluster integrable systems
We show that the dimer model on a bipartite graph on a torus gives rise to a
quantum integrable system of special type - a cluster integrable system. The
phase space of the classical system contains, as an open dense subset, the
moduli space of line bundles with connections on the graph. The sum of
Hamiltonians is essentially the partition function of the dimer model. Any
graph on a torus gives rise to a bipartite graph on the torus. We show that the
phase space of the latter has a Lagrangian subvariety. We identify it with the
space parametrizing resistor networks on the original graph.We construct
several discrete quantum integrable systems.Comment: This is an updated version, 75 pages, which will appear in Ann. Sci.
EN
The complexity of the list homomorphism problem for graphs
We completely classify the computational complexity of the list H-colouring
problem for graphs (with possible loops) in combinatorial and algebraic terms:
for every graph H the problem is either NP-complete, NL-complete, L-complete or
is first-order definable; descriptive complexity equivalents are given as well
via Datalog and its fragments. Our algebraic characterisations match important
conjectures in the study of constraint satisfaction problems.Comment: 12 pages, STACS 201
List homomorphism problems for signed graphs
We consider homomorphisms of signed graphs from a computational perspective.
In particular, we study the list homomorphism problem seeking a homomorphism of
an input signed graph , equipped with lists , of allowed images, to a fixed target signed graph . The
complexity of the similar homomorphism problem without lists (corresponding to
all lists being ) has been previously classified by Brewster and
Siggers, but the list version remains open and appears difficult. We illustrate
this difficulty by classifying the complexity of the problem when is a tree
(with possible loops). The tools we develop will be useful for classifications
of other classes of signed graphs, and we illustrate this by classifying the
complexity of irreflexive signed graphs in which the unicoloured edges form
some simple structures, namely paths or cycles. The structure of the signed
graphs in the polynomial cases is interesting, suggesting they may constitute a
nice class of signed graphs analogous to the so-called bi-arc graphs (which
characterize the polynomial cases of list homomorphisms to unsigned graphs).Comment: various changes + rewritten section on path- and cycle-separable
graphs based on a new conference submission (split possible in future
On the swap-distances of different realizations of a graphical degree sequence
One of the first graph theoretical problems which got serious attention
(already in the fifties of the last century) was to decide whether a given
integer sequence is equal to the degree sequence of a simple graph (or it is
{\em graphical} for short). One method to solve this problem is the greedy
algorithm of Havel and Hakimi, which is based on the {\em swap} operation.
Another, closely related question is to find a sequence of swap operations to
transform one graphical realization into another one of the same degree
sequence. This latter problem got particular emphases in connection of fast
mixing Markov chain approaches to sample uniformly all possible realizations of
a given degree sequence. (This becomes a matter of interest in connection of --
among others -- the study of large social networks.) Earlier there were only
crude upper bounds on the shortest possible length of such swap sequences
between two realizations. In this paper we develop formulae (Gallai-type
identities) for these {\em swap-distance}s of any two realizations of simple
undirected or directed degree sequences. These identities improves considerably
the known upper bounds on the swap-distances.Comment: to be publishe
- âŠ