相关论文: Counting planar diagrams with various restrictions

An outer-1-planar graph is a graph admitting a drawing in the plane so that all vertices appear in the outer region of the drawing and every edge crosses at most one other edge. This paper establishes the local structure of outer-1-planar…

In this paper, we consider distributed coloring for planar graphs with a small number of colors. We present an optimal (up to a constant factor) $O(\log{n})$ time algorithm for 6-coloring planar graphs. Our algorithm is based on a novel…

The combination of integrability and crossing symmetry has proven to give tight non-perturbative bounds on some planar structure constants in $\mathcal{N}$=4 SYM, particularly in the setup of defect observables built on a Wilson-Maldacena…

It is well-known that every maximal planar graph has a matching of size at least $\tfrac{n+8}{3}$ if $n\geq 14$. In this paper, we investigate similar matching-bounds for maximal \emph{1-planar} graphs, i.e., graphs that can be drawn such…

In the point set embeddability problem, we are given a plane graph $G$ with $n$ vertices and a point set $S$ with $n$ points. Now the goal is to answer the question whether there exists a straight-line drawing of $G$ such that each vertex…

A grid drawing of a graph maps vertices to grid points and edges to line segments that avoid grid points representing other vertices. We show that there is a number of grid points that some line segment of an arbitrary grid drawing must…

We construct novel conformal sigma models in three dimensions. Nonlinear sigma models in three dimensions are nonrenormalizable in perturbation theory. We use Wilsonian renormalization group equation method to find the fixed points.…

We initiate the study of the following problem: Given a non-planar graph G and a planar subgraph S of G, does there exist a straight-line drawing {\Gamma} of G in the plane such that the edges of S are not crossed in {\Gamma} by any edge of…

The purpose of this paper is to study the limiting distribution of special {\it additive functionals} on random planar maps, namely the number of occurrences of a given {\it pattern}. The main result is a central limit theorem for these…

A drawing of a graph is said to be a {\em straight-line drawing} if the vertices of $G$ are represented by distinct points in the plane and every edge is represented by a straight-line segment connecting the corresponding pair of vertices…

We give a practical formula for counting irreducible nodal genus-three plane curves that a fixed generic complex structure on the normalization. As an intermediate step, we enumerate rational plane curves that have a $(3,4)$-cusp.

Montassier, Raspaud, and Wang (2006) asked to find the smallest positive integers $d_0$ and $d_1$ such that planar graphs without $\{4,5\}$-cycles and $d^{\Delta}\ge d_0$ are $3$-choosable and planar graphs without $\{4,5,6\}$-cycles and…

Renormalization group (RG) and resummation techniques have been used in $N$-component $\phi^4$ theories at fixed dimensions below four to determine the presence of non-trivial IR fixed points and to compute the associated critical…

We use integrability at weak coupling to compute fishnet diagrams for four-point correlation functions in planar $\phi^4$ theory. The results are always multi-linear combinations of ladder integrals, which are in turn built out of classical…

Any effective field theory relies on power counting rules that allow one to perform a systematic expansion of calculated quantities in terms of some soft scales. However, a naive power counting can be violated due to the presence of various…

A graph is $\ell$-reconstructible if it is determined by its multiset of induced subgraphs obtained by deleting $\ell$ vertices. We prove that $3$-regular graphs are $2$-reconstructible.

The k-planar graphs, which are (usually with small values of k such as 1, 2, 3) subject to recent intense research, admit a drawing in which edges are allowed to cross, but each one edge is allowed to carry at most k crossings. In recently…

For large $n$ we determine exactly the maximum numbers of induced $C_4$ and $C_5$ subgraphs that a planar graph on $n$ vertices can contain. We show that $K_{2,n-2}$ uniquely achieves this maximum in the $C_4$ case, and we identify the…

Optimization over trained machine learning models has applications including: verification, minimizing neural acquisition functions, and integrating a trained surrogate into a larger decision-making problem. This paper formulates and solves…

The renormalization of the topological term in the two-dimensional nonlinear O(3) model is studied by means of the Functional Renormalization Group. By considering the topological charge as a limit of a more general operator, it is shown…