Related papers: Integrable deformations of systems on graphs with …

It is shown that the fourth order real self-adjoint difference operator on the Tivalent Tree admits nontrivial deformations preserving one energy level and therefore defines a nontrinial hierarhy of the completely integrable nonlinear…

The small cycle decompositions of line graph ($\lambda$-fold line graph) of complete graphs and complete bipartite graphs are studied by many papers. In particular, Colby and Rodger obtained necessary and sufficient conditions for the…

The notion of a contractible transformation on a graph was introduced by Ivashchenko as a means to study molecular spaces arising from digital topology and computer image analysis, and more recently has been applied to topological data…

This paper concerns fractional $K_s$-decompositions of multipartite graphs. For integers $r\ge s\ge 3$, we consider balanced $r$-partite graphs $G$ on $rn$ vertices. We establish necessary conditions for $G$ to admit a fractional…

Let $G$ be a plane graph with outer cycle $C$ and let $(L(v):v\in V(G))$ be a family of sets such that $|L(v)|\ge 5$ for every $v\in V(G)$. By an $L$-coloring of a subgraph $J$ of $G$ we mean a (proper) coloring $\phi$ of $J$ such that…

In this paper, we obtain two Kastler-Kalau-Walze type theorems for conformal perturbations of modified Novikov Operators on four-dimensional and six-dimensional compact manifolds with (respectively without)boundary.

We consider the problem of determining the inducibility (maximum possible asymptotic density of induced copies) of oriented graphs on four vertices. We provide exact values for more than half of the graphs, and very close lower and upper…

We investigate various perturbative properties of the deformed N=4 SYM theory. We carry out a three-loops calculation of the chiral matter superfield propagator and derive the condition on the couplings for maintaining finiteness at this…

We show that $3$-graphs on $n$ vertices whose codegree is at least $(2/3 + o(1))n$ can be decomposed into tight cycles and admit Euler tours, subject to the trivial necessary divisibility conditions. We also provide a construction showing…

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,…

A locally irregular graph is a graph whose adjacent vertices have distinct degrees. It was conjectured that every connected graph is edge decomposable to $3$ locally irregular subgraphs, unless it belongs to a certain family of exceptions,…

Given positive integers $p \ge k$, and a non-negative integer $d$, we say a graph $G$ is $(k,d,p)$-choosable if for every list assignment $L$ with $|L(v)|\geq k$ for each $v \in V(G)$ and $|\bigcup_{v\in V(G)}L(v)| \leq p$, there exists an…

Beginning with the planar limit of N=4 SYM theory, we study planar diagrams for field theory deformations of N=4 which are marginal at the free field theory level. We show that the requirement of integrability of the full one loop…

We show that $k$-uniform hypergraphs on $n$ vertices whose codegree is at least $(2/3 + o(1))n$ can be decomposed into tight cycles, subject to the trivial divisibility conditions. As a corollary, we show those graphs contain tight Euler…

In this paper we study the one-loop dilatation operator of the full scalar field sector of Leigh-Strassler deformed N=4 SYM theory. In particular we map it onto a spin chain and find the parameter values for which the Reshetikhin…

We showed in another paper [arXiv:1103.1759] that every connected graph can be realized as the cut locus of some point on some riemannian surface $S$. Here, criteria for the orientability of $S$ are given, and are applied to classify the…

In a balanced graph decomposition, every vertex of the host graph appears in the same number of blocks. We propose the use of colored loops as a framework for unifying various other types of local balance conditions in graph decompositions.…

A $K_4$-decomposition of a graph is a partition of its edges into $K_4$s. A fractional $K_4$-decomposition is an assignment of a nonnegative weight to each $K_4$ in a graph such that the sum of the weights of the $K_4$s containing any given…

Using integrability, we construct (to leading order in perturbation theory) the explicit form of twist-three light-ray operators in planar $\mathcal{N}=4$ SYM. This construction allows us to directly compute analytically continued CFT data…

In his survey "Beyond graph energy: Norms of graphs and matrices" (2016), Nikiforov proposed two problems concerning characterizing the graphs that attain equality in a lower bound and in a upper bound for the energy of a graph,…