739 research outputs found
A bipartite graph with non-unimodal independent set sequence
We show that the independent set sequence of a bipartite graph need not be
unimodal
Two problems on independent sets in graphs
Let denote the number of independent sets of size in a graph
. Levit and Mandrescu have conjectured that for all bipartite the
sequence (the {\em independent set sequence} of ) is
unimodal. We provide evidence for this conjecture by showing that is true for
almost all equibipartite graphs. Specifically, we consider the random
equibipartite graph , and show that for any fixed its
independent set sequence is almost surely unimodal, and moreover almost surely
log-concave except perhaps for a vanishingly small initial segment of the
sequence. We obtain similar results for .
We also consider the problem of estimating for
in various families. We give a sharp upper bound on the number of
independent sets in an -vertex graph with minimum degree , for all
fixed and sufficiently large . Specifically, we show that the
maximum is achieved uniquely by , the complete bipartite
graph with vertices in one partition class and in the
other.
We also present a weighted generalization: for all fixed and , as long as is large enough, if is a graph on
vertices with minimum degree then with equality if and only if
.Comment: 15 pages. Appeared in Discrete Mathematics in 201
On some varieties associated with trees
This article considers some affine algebraic varieties attached to finite
trees and closely related to cluster algebras. Their definition involves a
canonical coloring of vertices of trees into three colors. These varieties are
proved to be smooth and to admit sometimes free actions of algebraic tori. Some
results are obtained on their number of points over finite fields and on their
cohomology.Comment: 37 pages, 7 figure
On the Enumeration of Certain Weighted Graphs
We enumerate weighted graphs with a certain upper bound condition. We also
compute the generating function of the numbers of these graphs, and prove that
it is a rational function. In particular, we show that if the given graph is a
bipartite graph, then its generating function is of the form
, where is the number of vertices of the graph
and is a polynomial of degree at most .Comment: 25 page
- …