Related papers: A note on equitable colorings of forests
In the first part, we introduce a notion a degree of edge-colorings of bicubic plane graphs and proves some local formula of the graded number of colorings. In the second part, we give a new proof of a result of Fisk saying that any two…
The purpose of the paper is to present an short proof of the Chuang's inequality.
A $k$-ended tree is a tree with at most $k$ leaves. In this note, we give a simple proof for the following theorem. Let $G$ be a connected graph and $k$ be an integer ($k\geq 2$). Let $S$ be a vertex subset of $G$ such that $\alpha_{G}(S)…
In the present paper, we propose a refinement for the notion of quantum Markov states (QMS) on trees. A structure theorem for QMS on general trees is proved. We notice that any restriction of QMS in the sense of Ref. \cite{AccFid03} is not…
The relation between tempered distributions and measures is analysed and clarified. While this is straightforward for positive measures, it is surprisingly subtle for signed or complex measures.
R.P. Stanley defined a invariant for graphs called the chromatic symmetric function and conjectured it is complete invariant for trees. Miezaki et al. generalised the chromatic symmetric function and defined the Kneser chromatic functions…
We use a recently found generalization of the Cauchy-Binet theorem to give a new proof of the Chebotarev-Shamis forest theorem telling that det(1+L) is the number of rooted spanning forests in a finite simple graph G with Laplacian L. More…
We prove the following indistinguishability theorem for $k$-tuples of trees in the uniform spanning forest of $\mathbb{Z}^d$: Suppose that $\mathscr{A}$ is a property of a $k$-tuple of components that is stable under finite modifications of…
We show that for the edge ideals of a certain class of forests, the arithmetical rank equals the projective dimension.
We say a proper coloring of a graph is distance-$k$ fall if every vertex is within distance $k$ of at least one vertex of every color. We show that if $G$ is a connected graph of order at least $3$ that is $3$-colorable, thenit has a…
This paper describes an exact algorithm for the Equitable Coloring Problem, based on the well known DSatur algorithm for the classic Coloring Problem with new pruning rules specifically derived from the equity constraint. Computational…
An equitable coloring of a graph $G=(V,E)$ is a (proper) vertex-coloring of $G$, such that the sizes of any two color classes differ by at most one. In this paper, we consider the equitable coloring problem in block graphs. Recall that the…
This short note provides a simple formal proof of a folklore result in statistical phylogenetics concerning the convergence of bootstrap support for a tree and its edges.
We give a representation for labeled ordered trees that supports labeled queries such as finding the i-th ancestor of a node with a given label. Our representation is succinct, namely the redundancy is small-o of the optimal space for…
We study the local profiles of trees. We show that, in contrast with the situation for general graphs, the limit set of k-profiles of trees is convex. We initiate a study of the defining inequalities of this convex set. Many challenging…
The aim of this paper is to extend the external characterization of I-favorable spaces. This allows us to obtain a characterization of compact I-favorable spaces in terms of quasi k-metrics. We also provide proofs of some author's results…
Consider $k$-colorings of the complete tree of depth $\ell$ and branching factor $\Delta$. If we fix the coloring of the leaves, as $\ell$ tends to $\infty$, for what range of $k$ is the root uniformly distributed over all $k$ colors? This…
The induced arboricity of a graph $G$ is the smallest number of induced forests covering the edges of $G$. This is a well-defined parameter bounded from above by the number of edges of $G$ when each forest in a cover consists of exactly one…
In this note we answer a question of Kunen (15.13 [Mi91]) showing that it is consistent that there are full Souslin trees
The purpose of the present note is to review and improve the convergence of the renormalized winding fields.