1,420 research outputs found
Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems
Friedland's Lower Matching Conjecture asserts that if is a --regular
bipartite graph on vertices, and denotes the number of
matchings of size , then where . When
, this conjecture reduces to a theorem of Schrijver which says that a
--regular bipartite graph on vertices has at least
perfect matchings. L. Gurvits
proved an asymptotic version of the Lower Matching Conjecture, namely he proved
that
In this paper, we prove the Lower Matching Conjecture. In fact, we will prove
a slightly stronger statement which gives an extra factor
compared to the conjecture if is separated away from and , and is
tight up to a constant factor if is separated away from . We will also
give a new proof of Gurvits's and Schrijver's theorems, and we extend these
theorems to --biregular bipartite graphs
Equistarable graphs and counterexamples to three conjectures on equistable graphs
Equistable graphs are graphs admitting positive weights on vertices such that
a subset of vertices is a maximal stable set if and only if it is of total
weight . In , Mahadev et al.~introduced a subclass of equistable
graphs, called strongly equistable graphs, as graphs such that for every and every non-empty subset of vertices that is not a maximal stable set,
there exist positive vertex weights such that every maximal stable set is of
total weight and the total weight of does not equal . Mahadev et al.
conjectured that every equistable graph is strongly equistable. General
partition graphs are the intersection graphs of set systems over a finite
ground set such that every maximal stable set of the graph corresponds to a
partition of . In , Orlin proved that every general partition graph is
equistable, and conjectured that the converse holds as well.
Orlin's conjecture, if true, would imply the conjecture due to Mahadev,
Peled, and Sun. An intermediate conjecture, one that would follow from Orlin's
conjecture and would imply the conjecture by Mahadev, Peled, and Sun, was posed
by Miklavi\v{c} and Milani\v{c} in , and states that every equistable
graph has a clique intersecting all maximal stable sets. The above conjectures
have been verified for several graph classes. We introduce the notion of
equistarable graphs and based on it construct counterexamples to all three
conjectures within the class of complements of line graphs of triangle-free
graphs
Q-systems, Heaps, Paths and Cluster Positivity
We consider the cluster algebra associated to the -system for as a
tool for relating -system solutions to all possible sets of initial data. We
show that the conserved quantities of the -system are partition functions
for hard particles on particular target graphs with weights, which are
determined by the choice of initial data. This allows us to interpret the
simplest solutions of the Q-system as generating functions for Viennot's heaps
on these target graphs, and equivalently as generating functions of weighted
paths on suitable dual target graphs. The generating functions take the form of
finite continued fractions. In this setting, the cluster mutations correspond
to local rearrangements of the fractions which leave their final value
unchanged. Finally, the general solutions of the -system are interpreted as
partition functions for strongly non-intersecting families of lattice paths on
target lattices. This expresses all cluster variables as manifestly positive
Laurent polynomials of any initial data, thus proving the cluster positivity
conjecture for the -system. We also give an alternative formulation in
terms of domino tilings of deformed Aztec diamonds with defects.Comment: 106 pages, 38 figure
- …