Related papers: Region crossing change on planar trivalent graphs
Any simple planar graph can be triangulated, i.e., we can add edges to it, without adding multi-edges, such that the result is planar and all faces are triangles. In this paper, we study the problem of triangulating a planar graph without…
We study the interplay between principal pivot transform (pivot) and loop complementation for graphs. This is done by generalizing loop complementation (in addition to pivot) to set systems. We show that the operations together, when…
A triangulation of a polygon is a subdivision of it into triangles, using diagonals between its vertices. Two different triangulations of a polygon can be related by a sequence of flips: a flip replaces a diagonal by the unique other…
We give a brief introduction to some of the recent works on finding geometric structures on triangulated surfaces using variational principles.
Consider a random geometric graph over a random point process in $\mathbb{R}^d$. Two points are connected by an edge if and only if their distance is bounded by a prescribed distance parameter. We show that projecting the graph onto a two…
A tripartite-circle drawing of a tripartite graph is a drawing in the plane, where each part of a vertex partition is placed on one of three disjoint circles, and the edges do not cross the circles. We present upper and lower bounds on the…
This study investigates how visibility graphs constructed from Monte Carlo Markov Chain time series of spin models capture the critical behavior of the system. More precisely, we show that this approach identifies continuous phase…
A planar graph can be embedded in a piecewise linear manifold, and the lattice on each linear piece can be colored with 3-coloring. If a planar graph can be colored with multiple 3-coloring, i.e. coloring the graph in pieces with different…
In this paper, a regional knot invariant is constructed. Like the Wirtinger presentation of a knot group, each planar region contributes a generator, and each crossing contributes a relation. The invariant is call a tridle of the link. As…
Graphs are widely used for modeling various types of interactions, such as email communications and online discussions. Many of such real-world graphs are temporal, and specifically, they grow over time with new nodes and edges. Counting…
We consider a continuous-time quantum walk on a triple graph and investigate the influence of the side chain on the propagation in the main chain. Calculating the interchange of the probabilities between the two parts of the main chain, we…
It is well know that systems with an interaction decaying as a power of the distance may have critical exponents that are different from those of short-range systems. The boundary between long-range and short-range is known, however the…
Planar locally finite graphs which are almost vertex transitive are discussed. If the graph is 3-connected and has at most one end then the group of automorphisms is a planar discontinuous group and its structure is well-known. A general…
Networks (graphs) in psychology are often restricted to settings without interventions. Here we consider a framework borrowed from biology that involves multiple interventions from different contexts (observations and experiments) in a…
In this paper we study threshold coloring of graphs, where the vertex colors represented by integers are used to describe any spanning subgraph of the given graph as follows. Pairs of vertices with near colors imply the edge between them is…
We investigate the interplay between linear systems on curves and graphs in the context of specialization of divisors on an arithmetic surface. We also provide some applications of our results to graph theory, arithmetic geometry, and…
We consider an electron constrained to move on a surface with revolution symmetry in the presence of a constant magnetic field $B$ parallel to the surface axis. Depending on $B$ and the surface geometry the transverse part of the spectrum…
In [Fleurat, Salvy 2024], we introduced a model of block-weighted random maps that undergoes a phase transition as the density of separating elements changes. The purpose of this note is to demonstrate that the methodology we developed can…
We show that for percolation on any transitive graph, the triangle condition implies the open triangle condition.
The Bramson logarithmic shift of the position of pulled fronts is a universal feature common to a large class of monostable traveling wave equations. As one varies the non-linearities it so happens that one can observe, at some critical non…