 20103 Paul Federbush
 A PROOF of Weak Graph Positivity, for a Large Range of the Parameters
(40K, LaTeX)
Dec 19, 20

Abstract ,
Paper (src),
View paper
(auto. generated ps),
Index
of related papers

Abstract. One deals with rregular bipartite graphs with 2n vertices. In a previous paper Butera, Pernici, and the author have introduced a quantity d(i), a function of the number of
imatchings, and conjectured that as n goes to infinity the fraction of graphs that satisfy Delta^k( d(i)) is nonnegative, for all k and i, approaches 1. Here Delta is the finite difference operator. This conjecture we called the ``graph positivity conjecture''. ``Weak graph positivity'' is the conjecture that for each i and k the probability that Delta^k (d(i) is nonnegative goes to 1 as n goes to infinity. Here we prove this for the range of parameters where r < 11, i+k < 101, k < 21. A formalism of Wanless as systematized by Pernici is central to this effort.
 Files:
20103.src(
20103.comments ,
20103.keywords ,
PaulFile2.tex )