1,032 research outputs found
Some results on the palette index of graphs
Given a proper edge coloring of a graph , we define the palette
of a vertex as the set of all colors appearing
on edges incident with . The palette index of is the
minimum number of distinct palettes occurring in a proper edge coloring of .
In this paper we give various upper and lower bounds on the palette index of
in terms of the vertex degrees of , particularly for the case when
is a bipartite graph with small vertex degrees. Some of our results concern
-biregular graphs; that is, bipartite graphs where all vertices in one
part have degree and all vertices in the other part have degree . We
conjecture that if is -biregular, then , and we prove that this conjecture holds for several families of
-biregular graphs. Additionally, we characterize the graphs whose
palette index equals the number of vertices
Constructive degree bounds for group-based models
Group-based models arise in algebraic statistics while studying evolution
processes. They are represented by embedded toric algebraic varieties. Both
from the theoretical and applied point of view one is interested in determining
the ideals defining the varieties. Conjectural bounds on the degree in which
these ideals are generated were given by Sturmfels and Sullivant. We prove that
for the 3-Kimura model, corresponding to the group G=Z2xZ2, the projective
scheme can be defined by an ideal generated in degree 4. In particular, it is
enough to consider degree 4 phylogenetic invariants to test if a given point
belongs to the variety. We also investigate G-models, a generalization of
abelian group-based models. For any G-model, we prove that there exists a
constant , such that for any tree, the associated projective scheme can be
defined by an ideal generated in degree at most d.Comment: Boundedness results for equations defining the projective scheme were
extended to G-models (including 2-Kimura and all JC
Interval total colorings of graphs
A total coloring of a graph is a coloring of its vertices and edges such
that no adjacent vertices, edges, and no incident vertices and edges obtain the
same color. An \emph{interval total -coloring} of a graph is a total
coloring of with colors such that at least one vertex or edge
of is colored by , , and the edges incident to each vertex
together with are colored by consecutive colors, where
is the degree of the vertex in . In this paper we investigate
some properties of interval total colorings. We also determine exact values of
the least and the greatest possible number of colors in such colorings for some
classes of graphs.Comment: 23 pages, 1 figur
A new way to evaluate MOY graphs
We define a new way to evaluate MOY graphs. We prove that this new evaluation
coincides with the classical evaluation by checking some skein relations. As a
consequence, we prove a formula which relates the and
-evaluations of MOY graphs.Comment: Introduction rewritte
Graphs that are not pairwise compatible: A new proof technique (extended abstract)
A graph G = (V,E) is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree T and two non-negative real numbers dminand dmax, dmin≤ dmax, such that each node u∈V is uniquely associated to a leaf of T and there is an edge (u, v) ∈ E if and only if dmin≤ dT(u, v) ≤ dmax, where dT(u, v) is the sum of the weights of the edges on the unique path PT(u, v) from u to v in T. Understanding which graph classes lie inside and which ones outside the PCG class is an important issue. Despite numerous efforts, a complete characterization of the PCG class is not known yet. In this paper we propose a new proof technique that allows us to show that some interesting classes of graphs have empty intersection with PCG. We demonstrate our technique by showing many graph classes that do not lie in PCG. As a side effect, we show a not pairwise compatibility planar graph with 8 nodes (i.e. C28), so improving the previously known result concerning the smallest planar graph known not to be PCG
- …