Related papers: On Legendrian Thurston-Bennequin-symmetrical graph…
We give a generalization of Fukaya's Morse homotopy theoretic approach for 2-loop Chern--Simons perturbation theory to 3-valent graphs with arbitrary number of loops at least 2. We construct a sequence of invariants of integral homology…
A decomposition of a graph is a set of subgraphs whose edges partition those of $G$. The 3-decomposition conjecture posed by Hoffmann-Ostenhof in 2011 states that every connected cubic graph can be decomposed into a spanning tree, a…
Let $G$ be a graph. For $x\in V(G)$, let $N(x)=\{y\in V(G)\colon xy\in E(G)\}$. The minimum common degree of $G$, denoted by $\delta_{2}(G)$, is defined as the minimum of $|N(x)\cap N(y)|$ over all non-edges $xy$ of $G$. In 1982,…
In this paper, we develop a method for studying cycle lengths in hypergraphs. Our method is built on earlier ones used in [21,22,18]. However, instead of utilizing the well-known lemma of Bondy and Simonovits [4] that most existing methods…
We compute analytically the tetrahedron graph in Liouville theory on the pseudosphere. The result allows to extend the check of the bootstrap formula of Zamolodchikov and Zamolodchikov to third order perturbation theory of the coefficient…
It is proved in this note that the analogues of the Bennequin inequality which provide an upper bound for the Bennequin invariant of a Legendrian knot in the standard contact three dimensional space in terms of the lower degree in the…
The cycles are the only $2$-connected graphs in which any two nonadjacent vertices form a vertex cut. We generalize this fact by proving that for every integer $k\ge 3$ there exists a unique graph $G$ satisfying the following conditions:…
In the present paper a criteria for a rectangular diagram to admit a simplification is given in terms of Legendrian knots. It is shown that there are two types of simplifications which are mutually independent in a sense. A new proof of the…
We introduce a Legendrian invariant built out of the Turaev torsion of generating families. This invariant is defined for a certain class of Legendrian submanifolds of 1-jet spaces, which we call of Euler type. We use our invariant to study…
We show that the Thurston seminorms of all finite covers of an aspherical 3-manifold determine whether it is a graph manifold, a mixed 3-manifold or hyperbolic.
In this paper we clarify the relationship between ribbon surfaces of Legendrian graphs and quasipositive diagrams by using certain fence diagrams. As an application, we give an alternative proof of a theorem concerning a relationship…
The generalized volume conjecture and the AJ conjecture (a.k.a. the quantum volume conjecture) are extended to $U_q(\fraksl_2)$ colored quantum invariants of the theta and tetrahedron graph. The $\SL(2,\bC)$ character variety of the…
{\em Honeycomb toroidal graphs} are a family of cubic graphs determined by a set of three parameters, that have been studied over the last three decades both by mathematicians and computer scientists. They can all be embedded on a torus and…
Let $\mathcal{G}(k)$ denote the set of connected $k$-regular graphs $G$, $k\geq2$, where the number of vertices at distance 2 from any vertex in $G$ does not exceed $k$. Asratian (2006) showed (using other terminology) that a graph…
We introduce a notion of a girth-regular graph as a $k$-regular graph for which there exists a non-descending sequence $(a_1, a_2, \dots, a_k)$ (called the signature) giving, for every vertex $u$ of the graph, the number of girth cycles the…
In this expository paper we present some ideas of algebraic topology (more precisely, of homology theory) in a language accessible to non-specialists in the area. A $1$-cycle in a graph is a set $C$ of edges such that every vertex is…
Motivated by the moduli theory of taut contact circles on spherical 3-manifolds, we relate taut contact circles to transversely holomorphic flows. We give an elementary survey of such 1-dimensional foliations from a topological viewpoint.…
We show that the Alexander and Thurston norms are the same for all irreducible Eisenbud-Neumann graph links in homology 3-spheres. These are the links obtained by splicing Seifert links in homology 3-spheres together along tori. By…
The cycle set of a graph $G$ is the set consisting of all sizes of cycles in $G$. Answering a conjecture of Erd\H{o}s and Faudree, Verstra\"{e}te showed that there are at most $2^{n - n^{1/10}}$ different cycle sets of graphs with $n$…
A graph construction that produces a k-regular graph on n vertices for any choice of k >= 3 and n = m(k+1) for integer m >= 2 is described. The number of Hamiltonian cycles in such graphs can be explicitly determined as a function of n and…