English
Related papers

Related papers: Conic Formulations of Graph Homomorphisms

200 papers

The Graph Isomorphism problem has both theoretical and practical interest. In this paper we present an algorithm, called conauto-1.2, that efficiently tests whether two graphs are isomorphic, and finds an isomorphism if they are. This…

Data Structures and Algorithms · Computer Science 2011-06-23 Jose Luis Lopez-Presa , Antonio Fernandez Anta

We find sufficient conditions for log-convexity and log-concavity for the functions of the forms $a\mapsto\sum{f_k}(a)_kx^k$, $a\mapsto\sum{f_k}\Gamma(a+k)x^k$ and $a\mapsto\sum{f_k}x^k/(a)_k$. The most useful examples of such functions are…

Classical Analysis and ODEs · Mathematics 2016-09-20 D. Karp , S. M. Sitnik

The Shannon capacity of a graph is an important graph invariant in information theory that is extremely difficult to compute. The Lovasz number, which is based on semidefinite programming relaxation, is a well-known upper bound for the…

Optimization and Control · Mathematics 2019-01-24 Yingjie Bi , Ao Tang

The purpose of this article is to show that even the most elementary problems in asymptotic extremal graph theory can be highly non-trivial. We study linear inequalities between graph homomorphism densities. In the language of quantum…

Combinatorics · Mathematics 2010-10-19 Hamed Hatami , Serguei Norine

In this paper we enumerate the necessary and sufficient conditions for the weak modular product of two simple graphs to be perfect. The weak modular product differs from the direct product by also encoding non-adjacencies of the factor…

Combinatorics · Mathematics 2018-09-27 Danial Dervovic

Suppose $Y$ is a regular covering of a graph $X$ with covering transformation group $\pi = \mathbb{Z}$. This paper gives an explicit formula for the $L^2$ zeta function of $Y$ and computes examples. When $\pi = \mathbb{Z}$, the $L^2$ zeta…

Number Theory · Mathematics 2007-05-23 Bryan Clair

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…

Discrete Mathematics · Computer Science 2024-02-14 Thomas Bellitto , Christopher Duffy , Gary MacGillivray

We study variants of the well-known Collatz graph, by considering the action of the 3n+1 function on congruence classes. For moduli equal to powers of 2, these graphs are shown to be isomorphic to binary De Bruijn graphs. Unlike the Collatz…

Number Theory · Mathematics 2013-11-11 Thijs Laarhoven , Benne de Weger

A graph $G$ covers a graph $H$ if there exists a locally bijective homomorphism from $G$ to $H$. We deal with regular covers in which this locally bijective homomorphism is prescribed by an action of a subgroup of ${\rm Aut}(G)$. Regular…

Combinatorics · Mathematics 2014-05-29 Jiří Fiala , Pavel Klavík , Jan Kratochvíl , Roman Nedela

In this paper we address the graph matching problem. Following the recent works of \cite{zaslavskiy2009path,Vestner2017} we analyze and generalize the idea of concave relaxations. We introduce the concepts of conditionally concave and…

Optimization and Control · Mathematics 2018-12-27 Haggai Maron , Yaron Lipman

We consider the problem of exact and inexact matching of weighted undirected graphs, in which a bijective correspondence is sought to minimize a quadratic weight disagreement. This computationally challenging problem is often relaxed as a…

Data Structures and Algorithms · Computer Science 2014-10-14 Yonathan Aflalo , Alex Bronstein , Ron Kimmel

Lattice-based cryptography is not only for thwarting future quantum computers, and is also the basis of Fully Homomorphic Encryption. Motivated from the advantage of graph homomorphisms we combine graph homomorphisms with graph total…

Combinatorics · Mathematics 2020-05-06 Bing Yao , Hongyu Wang

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…

Combinatorics · Mathematics 2021-11-16 Frederik Garbe , Jan Hladký , Joonkyung Lee

In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs. To this end we develop new techniques applicable for the structural and…

Discrete Mathematics · Computer Science 2014-11-10 Pascal Schweitzer

We compute a canonical circular-arc representation for a given circular-arc (CA) graph which implies solving the isomorphism and recognition problem for this class. To accomplish this we split the class of CA graphs into uniform and…

Data Structures and Algorithms · Computer Science 2018-02-02 Maurice Chandoo

Let $H: V(G) \rightarrow 2^{\mathbb{N}}$ be a set mapping for a graph $G$. Given a spanning subgraph $F$ of $G$, $F$ is called a {\it general factor} or an $H$-{\it factor} of $G$ if $d_{F}(x)\in H(x)$ for every vertex $x\in V(G)$.…

Combinatorics · Mathematics 2011-04-28 Hongliang Lu , Qinglin Yu

A theorem of Kontsevich relates the homology of certain infinite dimensional Lie algebras to graph homology. We formulate this theorem using the language of reversible operads and mated species. All ideas are explained using a pictorial…

Quantum Algebra · Mathematics 2007-05-23 Swapneel Mahajan

The aim of this paper is to give another proof to a result on the image of a homogeneous quadratic map which is positive with respect to a homogeneous cone, given by Graczyk and Ishi in 2014. The new proof depends on a purely algebraic…

Algebraic Geometry · Mathematics 2020-11-26 Hideto Nakashima

In earlier work we studied features of non-holomorphic modular functions associated with Feynman graphs for a conformal scalar field theory on a two-dimensional torus with zero external momenta at all vertices. Such functions, which we will…

High Energy Physics - Theory · Physics 2017-08-30 Eric D'Hoker , Michael B. Green , Omer Gurdogan , Pierre Vanhove

Lov\'asz conjectured that every connected 4-regular planar graph G admits a realization as a system of circles, i.e., it can be drawn on the plane utilizing a set of circles, such that the vertices of G correspond to the intersection and…

Data Structures and Algorithms · Computer Science 2019-09-05 Michael A. Bekos , Chrysanthi N. Raftopoulou