Related papers: Williams' Conjecture holds for meteor graphs

We show that for a sequence of random graphs Brouwer's conjecture holds true with probability tending to one as the number of vertices tends to infinity. Surprisingly, it was found that a similar statement holds true for weighted graphs…

Wu, Zhang and Li [4] conjectured that the set of vertices of any simple graph $G$ can be equitably partitioned into $\lceil(\Delta(G)+1)/2\rceil$ subsets so that each of them induces a forest of $G$. In this note, we prove this conjecture…

A graph $H$ is said to be positive if the homomorphism density $t_H(G)$ is non-negative for all weighted graphs $G$. The positive graph conjecture proposes a characterisation of such graphs, saying that a graph is positive if and only if it…

We provide a complete answer to the question "When is a quotient of a Leavitt path algebra isomorphic to a Leavitt path algebra?" in terms of the interaction of the kernel of the quotient homomorphism with the cycles of the digraph. A key…

This paper explores the effect of various graphical constructions upon the associated graph $C^*$-algebras. The graphical constructions in question arise naturally in the study of flow equivalence for topological Markov chains. We prove…

We introduce the notion of orbit equivalence of directed graphs, following Matsumoto's notion of continuous orbit equivalence for topological Markov shifts. We show that two graphs in which every cycle has an exit are orbit equivalent if…

While every matrix algebra over a field $K$ can be realized as a Leavitt path algebra, this is not the case for every graded matrix algebra over a graded field. We provide a complete description of graded matrix algebras over a field,…

In [W. Mader, Connectivity keeping paths in $k$-connected graphs, J. Graph Theory 65 (2010) 61-69.], Mader conjectured that for every positive integer $k$ and every finite tree $T$ with order $m$, every $k$-connected, finite graph $G$ with…

We prove that the Bowen-Franks group classifies the Leavitt path algebras of purely infinite simple finite graphs over a regular supercoherent commutative ring with involution where $2$ is invertible, equipped with their standard…

If $E$ is a not-necessarily row-finite graph, such that each vertex of $E$ emits at most countably many edges, then a {\it desingularization} $F$ of $E$ can be constructed (see e.g. (1) G. Abrams, G. Aranda Pino, Leavitt path algebras of…

Extending the work of Godsil and others, we investigate the notion of the inverse of a graph (specifically, of bipartite graphs with a unique perfect matching). We provide a concise necessary and sufficient condition for the invertibility…

We prove the existence of Morita equivalences between the spin blocks at the extremal points of strings in the block-reduced crystal graph. When the parities of the core partitions are not preserved, these equivalences require crossovers,…

Motivated by recent results in graph C*-algebras concerning an equivariant pushout structure of the Vaksman-Soibelman quantum odd spheres, we introduce a class of graphs called trimmable. Then we show that the Leavitt path algebra of a…

We show the Williams Conjecture is false for irreducible shifts of finite type by examining relative sign-gyration numbers of conjugacies between shifts with no points of period one or two.

A graph $\G$ is {\em symmetric} or {\em arc-transitive} if its automorphism group $\Aut(\G)$ is transitive on the arc set of the graph, and $\G$ is {\em basic} if $\Aut(\G)$ has no non-trivial normal subgroup $N$ such that the quotient…

A graph $\Gamma$ is $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of arcs of $\Gamma$, where an arc is an ordered pair of adjacent vertices. Let $\Gamma$ be a $G$-symmetric graph such that its…

In this paper, we prove a tight minimum degree condition in general graphs for the existence of paths between two given endpoints, whose lengths form a long arithmetic progression with common difference one or two. This allows us to obtain…

We prove that two virtual knots have equivalent intersection graphs if and only if they have the same writhe polynomial.

For all integers $g \geq 6$ we prove the existence of a metric graph $G$ with $w^1_4=1$ such that $G$ has Clifford index 2 and there is no tropical modification $G'$ of $G$ such that there exists a finite harmonic morphism of degree 2 from…

Several relations on graphs, including primitive equivalence, explosion equivalence and strong shift equivalence, are examined and shown to preserve either the graph groupoid, a construction of Kumjian, Pask, Raeburn, and Renault, or the…