Search

Lov\'{a}sz et al. proved that every $6$-edge-connected graph has a nowhere-zero $3$-flow. In fact, they proved a more technical statement which says that there exists a nowhere zero $3$-flow that extends the flow prescribed on the incident edges of a single vertex $z$ with bounded degree. We extend this theorem of Lov\'{a}sz et al. to allow $z$ to have arbitrary degree, but with the additional assumption that there is another vertex $x$ with large degree and no small cut separating $x$ and $z$. Using this theorem, we prove two results regarding the generation of minimal graphs with the property that prescribing the edges incident to a vertex with specific flow does not extend to a nowhere-zero $3$-flow. We use this to further strengthen the theorem of Lov\'{a}sz et al., as well as make progress on a conjecture of Li et al., Comment: 51 pages

A quantum Latin square is an $n \times n$ array of unit vectors where each row and column forms an orthonormal basis of a fixed complex vector space. We introduce the notion of $(G,G')$-invariant quantum Latin squares for finite groups $G$ and $G'$. These are quantum Latin squares with rows and columns indexed by $G$ and $G'$ respectively such that the inner product of the $a,b$-entry with the $c,d$-entry depends only on $a^{-1}c \in G$ and $b^{-1}d \in G'$. This definition is motivated by the notion of group invariant bijective correlations introduced in [Roberson \& Schmidt (2020)], and every group invariant quantum Latin square produces a group invariant bijective correlation, though the converse does not hold. In this work we investigate these group invariant quantum Latin squares and their corresponding correlations. Our main result is that, up to applying a global isometry to every vector in a $(G,G')$-invariant quantum Latin square, there is a natural bijection between these objects and trace and conjugate transpose preserving isomorphisms between the group algebras of $G$ and $G'$. This in particular proves that a $(G,G')$-invariant quantum Latin square exists if and only if the multisets of degrees of irreducible representations are equal for $G$ and $G'$. Another motivation for this line of work is that whenever Cayley graphs for groups $G$ and $G'$ are quantum isomorphic, then there is a $(G,G')$-invariant quantum correlation witnessing this, and thus it suffices to consider such correlations when searching for quantum isomorphic Cayley graphs. Given a group invariant quantum correlation, we show how to construct all pairs of graphs for which it gives a quantum isomorphism., Comment: Added Section 11 on "support graphs" of correlations

Evra, Feigon, Maurischat, and Parzanchevski (2023) introduced a biregular extension of Cayley graphs. In this paper, we reformulate their definition and provide some basic properties. We also show how these Cayley incidence graphs relate to various notions of Cayley hypergraphs. We further establish connections between Cayley incidence graphs and certain geometric and combinatorial structures, including coset geometries, difference sets and cages., Comment: 35 pages, 2 figures

Sabidussi's theorem [Duke Math. J. 28, 1961] gives necessary and sufficient conditions under which the automorphism group of a lexicographic product of two graphs is a wreath product of the respective automorphism groups. We prove a quantum version of Sabidussi's theorem for finite graphs, with the automorphism groups replaced by quantum automorphism groups and the wreath product replaced by the free wreath product of quantum groups. This extends the result of Chassaniol [J. Algebra 456, 2016], who proved it for regular graphs. Moreover, we apply our result to lexicographic products of quantum vertex transitive graphs, determining their quantum automorphism groups even when Sabidussi's conditions do not apply., Comment: 21 pages, 2 figures. Minor changes, mostly improvements to the exposition

A graph is called integral if all its eigenvalues are integers. A Cayley graph is called normal if its connection set is a union of conjugacy classes. We show that a non-empty integral normal Cayley graph for a group of odd order has an odd eigenvalue., Comment: 8 pages

In this paper, we characterize perfect state transfer in Cayley graphs for abelian groups that have a cyclic Sylow-2-subgroup. This generalizes a result of Ba\v{s}i\'c from 2013 where he provides a similar characterization for Cayley graphs of cyclic groups., Comment: 21 pages, 1 figure

We prove an upper bound on the number of pairwise strongly cospectral vertices in a normal Cayley graph, in terms of the multiplicities of its eigenvalues. We use this to determine an explicit bound in Cayley graphs of $\mathbb{Z}_2^d$ and $\mathbb{Z}_4^d$. We also provide some infinite families of Cayley graphs of $\mathbb{Z}_2^d$ with a set of four pairwise strongly cospectral vertices and show that such graphs exist in every dimension., Comment: 23 pages, 4 figures

A connected, locally finite graph $\Gamma$ is a Cayley--Abels graph for a totally disconnected, locally compact group $G$ if $G$ acts vertex-transitively with compact, open vertex stabilizers on $\Gamma$. Define the minimal degree of $G$ as the minimal degree of a Cayley--Abels graph of $G$. We relate the minimal degree in various ways to the modular function, the scale function and the structure of compact open subgroups. As an application, we prove that if $T_d$ denotes the $d$-regular tree, then the minimal degree of ${\rm Aut}(T_d)$ is $d$ for all $d\geq 2$.

We study groups acting vertex-transitively on connected, trivalent graphs such that stabilizers of vertices are infinite. If the action is edge-transitive, we prove that the graph has to be a tree. We analyze the case where the action is not edge-transitive and fully classify the possible $2$-ended graphs. We draw connections to Willis' scale function and re-prove a result by Trofimov.