Related papers: Strong cospectrality in trees
In $2011$, Herzog, Hibi, and Ohsugi conjectured that if $J$ is the cover ideal of a chordal graph, then $J^s$ is componentwise linear for all $s \ge 1.$ In 2022, H\`a and Tuyl considered objects more general than chordal graphs and posed…
We introduce a switching operation, inspired by the Godsil-McKay switching, in order to obtain pairs of $G$-cospectral gain graphs, that are gain graphs cospectral with respect to every representation of the gain group $G$. For instance,…
We give a proof for sharp estimate for the number of spanning trees using linear algebra and generalize this bound to multigraphs. In addition, we show that this bound is tight for complete graphs. In addition, we give estimates for number…
An antimagic labeling a connected graph $G$ is a bijection from the set of edges $E(G)$ to $\{1,2,\dots,|E(G)|\}$ such that all vertex sums are pairwise distinct, where the vertex sum at vertex $v$ is the sum of the labels assigned to edges…
It is a long-standing question of Stanley whether or not the chromatic symmetric function (CSF) distinguishes unrooted trees. Previously, the best computational result, due to Russell, proved that it distinguishes all trees with at most…
We consider packing tree degree sequences in this paper. We set up a conjecture that any arbitrary number of tree degree sequences without common leaves have edge disjoint tree realizations. This conjecture is known to be true for $2$ and…
Arthur Cayley famously proved that there are n to the power n-2 labeled trees on n vertices. Here we go much further and show how to enumerate, fully automatically, labeled trees such that every vertex has a number of neighbors that belongs…
We obtain the maximum sum-connectivity indices of graphs in the set of trees and in the set of unicyclic graphs respectively with given number of vertices and maximum degree, and determine the corresponding extremal graphs. Additionally, we…
We prove that there exist finitely generated, stably finite algebras which are non linear sofic. This was left open by Arzhantseva and P\u{a}unescu in 2017.
Raspaud and Wang conjectured that every triangle-free planar graph can be vertex-partitioned into an independent set and a forest. Independently, Kawarabayashi and Thomassen also remarked that this might be true, after providing another…
We analyze a countable support product of a free Suslin tree which turns it into a highly rigid Kurepa tree with no Aronszajn subtree. In the process, we introduce a new rigidity property for trees, which says roughly speaking that any…
We present a smooth, complete toric threefold with no nontrivial nef line bundles. This is a counterexample to a recent conjecture of Fujino.
The present paper, III, is the third part of a series of papers, under the global title "the non triviality of a $\Phi_4^4$ model". Parts I and II have been previously completed. In them thanks to the properties we dubbed "splitting -tree…
The \textit{eccentricity matrix} $\mathcal{E}(G)$ of a connected graph $G$ is obtained from the distance matrix of $G$ by keeping the largest non-zero entries in each row and each column, and leaving zeros in the remaining ones. The…
The arboricity $\Gamma(G)$ of an undirected graph $G =(V,E)$ is the minimal number $k$ such that $E$ can be partitioned into $k$ forests on $V$. Nash-Williams' formula states that $k = \lceil \gamma(G) \rceil$, where $\gamma(G)$ is the…
Trees fill many extremal roles in graph theory, being minimally connected and serving a critical role in the definition of $n$-good graphs. In this article, we consider the generalization of trees to the setting of $r$-uniform hypergraphs…
In this paper we give an example of a closed, strongly one-sided dense set which is not of uniform density type. We also show that there is a set of uniform density type which is not of strong uniform density type.
We study the spectrum of pure massless higher spin theories in $AdS_3$. The light spectrum is given by a tower of massless particles of spin $s=2,\cdots,N$ and their multi-particles states. Their contribution to the torus partition function…
We call a tree $T$ is \emph{even} if every pair of its leaves is joined by a path of even length. Jackson and Yoshimoto~[J. Graph Theory, 2024] conjectured that every $r$-regular nonbipartite connected graph $G$ has a spanning even tree.…
The search of spanning trees with interesting disjunction properties has led to the introduction of edge-disjoint spanning trees, independent spanning trees and more recently completely independent spanning trees. We group together these…