Related papers: Planar #CSP Equality Corresponds to Quantum Isomor…

Let $M$ be an irreducible smooth projective variety, defined over an algebraically closed field, equipped with an action of a connected reductive affine algebraic group $G$, and let ${\mathcal L}$ be a $G$--equivariant very ample line…

Holant problems are a family of counting problems parameterised by sets of algebraic-complex valued constraint functions, and defined on graphs. They arise from the theory of holographic algorithms, which was originally inspired by concepts…

Determining whether two graphs are structurally identical is a fundamental problem with applications spanning mathematics, computer science, chemistry, and network science. Despite decades of study, graph isomorphism remains a challenging…

A geometric graph G(bar) is a simple graph drawn in the plane, on points in general position, with straight-line edges. We call G(bar) a geometric realization of the underlying abstract graph G. A geometric homomorphism is a vertex map that…

In the counting Graph Homomorphism problem (#GraphHom) the question is: Given graphs G,H, find the number of homomorphisms from G to H. This problem is generally #P-complete, moreover, Cygan et al. proved that unless the ETH is false there…

Homomorphically full graphs are those for which every homomorphic image is isomorphic to a subgraph. We extend the definition of homomorphically full to oriented graphs in two different ways. For the first of these, we show that…

A graph G is called "minimalizable" if a diagram with minimal crossing number can be obtained from an arbitrary diagram of G by crossing changes. If, furthermore, the minimal diagram is unique up to crossing changes then G is called…

Lov\'asz (1967) showed that two finite relational structures A and B are isomorphic if, and only if, the number of homomorphisms from C to A is the same as the number of homomorphisms from C to B for any finite structure C. Soon after,…

Let $G$ be a discrete group and let $\mathcal A$ and $\mathcal B$ be two subgroups of $G$-valued continuous functions defined on two $0$-dimensional compact spaces $X$ and $Y$. A group isomorphism $H$ defined between $\mathcal A$ and…

A graph $\Gamma$ is $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. If $V(\Gamma)$ admits a nontrivial $G$-invariant partition ${\cal B}$ such…

For a graph $H$, its homomorphism density in graphs naturally extends to the space of two-variable symmetric functions $W$ in $L^p$, $p\geq e(H)$, denoted by $t(H,W)$. One may then define corresponding functionals…

A discrete-time quantum walk on a graph is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. If this unitary evolution operator has an associated group of symmetries, then for certain…

Graph matching or quadratic assignment, is the problem of labeling the vertices of two graphs so that they are as similar as possible. A common method for approximately solving the NP-hard graph matching problem is relaxing it to a convex…

We introduce a directed graph related to a group $G$, which we call the N-prime graph $\Gamma_{\rm{N}}(G)$ of $G$ and which is a refinement of the classical Gruenberg-Kegel graph. The vertices of $\Gamma_{\rm{N}}(G)$ are the primes $p$ such…

A homomorphism from a graph $G$ to a graph $H$ is an edge-preserving mapping from $V(G)$ to $V(H)$. In the graph homomorphism problem, denoted by $Hom(H)$, the graph $H$ is fixed and we need to determine if there exists a homomorphism from…

Let $G$ be a group. The BCI problem asks whether two Haar graphs of $G$ are isomorphic if and only if they are isomorphic by an element of an explicit list of isomorphisms. We first generalize this problem in a natural way and give a…

Many important results in extremal graph theory can be roughly summarised as "if a triangle-free graph $G$ has certain properties, then it has a homomorphism to a triangle-free graph $\Gamma$ of bounded size". For example, bounds on…

The conformal invariance and universality results of Chelkak-Smirnov on the two-dimensional Ising model hold for isoradial planar graphs with critical weights. Motivated by the problem of extending these results to a wider class of graphs,…

Let $G$ and $H$ be Hausdorff ample groupoids and let $R$ be a commutative unital ring. We show that if $G$ and $H$ are equivalent in the sense of Muhly-Renault-Williams, then the associated Steinberg algebras of locally constant $R$-valued…

We introduce an operator-algebraic framework for Morita equivalence of quantum graphs based on $\Delta$-equivalence of operator systems introduced by Eleftherakis, Kakariadis and Todorov. Adopting the perspective of Weaver, we view quantum…