Related papers: Vector-relation configurations and plabic graphs

Given two subsets A and B of nodes in a directed graph, the conduciveness of the graph from A to B is the ratio representing how many of the edges outgoing from nodes in A are incoming to nodes in B. When the graph's nodes stand for the…

The modelling of interconnection networks by graphs motivated the study of several extremal problems that involve well known parameters of a graph (degree, diameter, girth and order) and ask for the optimal value of one of them while…

We present a sufficient condition for the stability property of extremal graph problems that can be solved via Zykov's symmetrisation. Our criterion is stated in terms of an analytic limit version of the problem. We show that, for example,…

In this paper we study local unitary invariants of a multi-partite quantum state that are monotonic, on average, under local operations and classical communication (locc). In particular we focus on local unitary invariants that are…

In the present paper, we apply Alexandrov geometry methods to study geometric analysis aspects of infinite semiplanar graphs with nonnegative combinatorial curvature in the sense of Higuchi. We obtain the metric classification of these…

Associated to every state surface for a knot or link is a state graph, which embeds as a spine of the state surface. A state graph can be decomposed along cut-vertices into graphs with induced planar embeddings. Associated with each such…

We study connected graphs with a fixed degree sequence, in the sparse setting where the number of edges grows linearly in the number of vertices. Using the relation to the configuration model, we identify the number of such connected graphs…

We study planar "vertex" models, which are probability measures on edge subsets of a planar graph, satisfying certain constraints at each vertex, examples including dimer model, and 1-2 model, which we will define. We express the local…

The study of graph vertex colorability from an algebraic perspective has introduced novel techniques and algorithms into the field. For instance, it is known that $k$-colorability of a graph $G$ is equivalent to the condition $1 \in…

Quantum entanglement in multipartite systems cannot be shared freely. In order to illuminate basic rules of entanglement sharing between qubits we introduce a concept of an entangled structure (graph) such that each qubit of a multipartite…

In order to obtain perfect state transfer between two sites in a network of interacting qubits, their corresponding vertices in the underlying graph must satisfy a combinatorial property called strong cospectrality. Here we determine the…

We introduce a new graph polynomial that encodes interesting properties of graphs, for example, the number of matchings and the number of perfect matchings. Most importantly, for bipartite graphs the polynomial encodes the number of…

A fixed-mobile bigraph G is a bipartite graph such that the vertices of one partition set are given with fixed positions in the plane and the mobile vertices of the other part, together with the edges, must be added to the drawing. We…

This paper describes several new problems and ideas concerning algebraic geometry and complexity theory. It first uses the idea of coloring graphs with elements of finite fields. This procedure then shows that graph coloring problems can be…

Bipartite networks appear in many real-world contexts, linking entities across two distinct sets. They are often analyzed via one-mode projections, but such projections can introduce artificial correlations and inflated clustering,…

A graph is called 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we establish a local property of 1-planar graphs which describes the structure in the neighborhood of small…

We study alternating strand diagrams on the disk with an orbifold point. These are quotients by rotation of Postnikov diagrams on the disk, and we call them orbifold diagrams. We associate a quiver with potential to each orbifold diagram,…

Geometric modeling by constraints leads to large systems of algebraic equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into…

We consider embeddings of 3-regular graphs into 3-dimensional Cartesian coordinates, in such a way that two vertices are adjacent if and only if two of their three coordinates are equal (that is, if they lie on an axis-parallel line) and…

Spectral embedding is a procedure which can be used to obtain vector representations of the nodes of a graph. This paper proposes a generalisation of the latent position network model known as the random dot product graph, to allow…