Related papers: Conic Formulations of Graph Homomorphisms
The lexicographic product $G[H]$ of two graphs $G$ and $H$ is obtained from $G$ by replacing each vertex with a copy of $H$ and adding all edges between any pair of copies corresponding to adjacent vertices of $G$. We consider also the…
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…
Inspired by the log Gromov-Witten (or GW) theory of Gross-Siebert/Abramovich-Chen, we introduce a geometric notion of log J-holomorphic curve relative to a simple normal crossings symplectic divisor defined in [FMZ1]. Every such moduli…
The isomorphism problem is known to be efficiently solvable for interval graphs, while for the larger class of circular-arc graphs its complexity status stays open. We consider the intermediate class of intersection graphs for families of…
In this article we discuss classical theorems from Convex Geometry in the context of topological drawings and beyond. In a simple topological drawing of the complete graph $K_n$, any two edges share at most one point: either a common vertex…
Investigation of the generalized trigonometric and hyperbolic functions containing two parameters has been a very active research area over the last decade. We believe, however, that their monotonicity and convexity properties with respect…
The generic homomorphism problem, which asks whether an input graph $G$ admits a homomorphism into a fixed target graph $H$, has been widely studied in the literature. In this article, we provide a fine-grained complexity classification of…
We propose a simple and efficient local algorithm for graph isomorphism which succeeds for a large class of sparse graphs. This algorithm produces a low-depth canonical labeling, which is a labeling of the vertices of the graph that…
Motivic and topological zeta functions are singularity invariants, mainly associated to a function $f$ and a top differential form $\omega$ on a smooth variety. When $\omega$ is the standard form $dx_1\wedge \dots \wedge dx_n$ on affine…
We define a generalization of convex functions, which we call $\delta$-convex functions, and show they must satisfy interior H\"older and $W^{1,p}$ estimates. As an application, we consider solutions of a certain class of fully nonlinear…
We prove that random $\mathbb{Z}$-homomorphisms on weakly expanding bipartite graphs exhibit a strong "flatness" phenomenon. Extending prior work of Peled, Samotij, and Yehudayoff for expanders, we first show that on any bipartite $(n, d,…
Many recursive functions can be defined elegantly as the unique homomorphisms, between two algebras, two coalgebras, or one each, that are induced by some universal property of a distinguished structure. Besides the well-known applications…
The $L^2$-zeta function of an infinite graph Y (defined previously in a ball around zero) has an analytic extension. For a tower of finite graphs covered by Y, the normalized zeta functions of the finite graphs converge to the $L^2$-zeta…
In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…
Let the join of two graphs be the union of two disjoint graphs connected by $j$ edges in a one-to-one manner. In previous work by Gyurov and Pinzon, which generalized the results of Badura and Rara, the determinant of the adjacency matrix…
In this paper we present a proof system that operates on graphs instead of formulas. Starting from the well-known relationship between formulas and cographs, we drop the cograph-conditions and look at arbitrary undirected) graphs. This…
The author introduced models of linear logic known as ''Interaction Graphs'' which generalise Girard's various geometry of interaction constructions. In this work, we establish how these models essentially rely on a deep connection between…
An analog of Kreimer's coproduct from renormalization of Feynman integrals in quantum field theory, endows an analog of Kontsevich's graph complex with a dg-coalgebra structure. The graph complex is generated by orientation classes of…
We interpret realizations of a graph on the sphere up to rotations as elements of a moduli space of curves of genus zero. We focus on those graphs that admit an assignment of edge lengths on the sphere resulting in a flexible object. Our…
We give a closed formula for Lovasz theta number of the powers of cycle graphs and of their complements, the circular complete graphs. As a consequence, we establish that the circular chromatic number of a circular perfect graph is…