Related papers: On Legendrian Thurston-Bennequin-symmetrical graph…
Examples are given of prime Legendrian knots in the standard contact 3-space that have arbitrarily many distinct Chekanov polynomials, refuting a conjecture of Lenny Ng. These are constructed using a new `Legendrian tangle replacement'…
We present an approach for the traveling salesman problem with graph metric based on Steiner cycles. A Steiner cycle is a cycle that is required to contain some specified subset of vertices. For a graph $G$, if we can find a spanning tree…
The monography considers the problem of constructing a Hamiltonian cycle in a complete graph. A rule for constructing a Hamiltonian cycle based on isometric cycles of a graph is established. An algorithm for constructing a Hamiltonian cycle…
In this short note, we construct a family of non-regular, and therefore non-decomposable, Lagrangian concordances between Lagrangian fillable Legendrian knots in the standard contact 3-dimensional sphere. More precisely, for every…
A long-standing conjecture of Thomassen says that every longest cycle of a $3$-connected graph has a chord. Thomassen (2018) proved that if $G$ is a $2$-connected cubic graph, then any longest cycle must have a chord. He also showed that in…
We prove two results on the classification of trivial Legendrian embeddings $g: G \rightarrow (S^3,\xi_{std})$ of planar graphs. First, the oriented Legendrian ribbon $R_g$ and rotation invariant $\text{rot}_g$ are a complete set of…
In this paper we consider the relation between the spectrum and the number of short cycles in large graphs. Suppose $G_1, G_2, G_3, \ldots$ is a sequence of finite and connected graphs that share a common universal cover $T$ and such that…
A wheel is a graph formed by a chordless cycle and a vertex that has at least three neighbors in the cycle. We prove that every 3-connected graph that does not contain a wheel as a subgraph is in fact minimally 3-connected. We give a new…
We show that if a smooth projective curve $C\subset\mathbb P^3$ (over an algebraically closed field of characteristic zero) is Legendrian with respect to a contact structure (it is well known that a contact structure on $\mathbb P^3$ is…
We use the Ozsv\'ath-Szab\'o contact invariants to distinguish between tight contact structures obtained by Legendrian surgeries on stabilized Legendrian links in tight contact 3-manifolds. We also discuss the implication of our result on…
In this paper we are interested in an intrinsic property of graphs which is derived from their embeddings into the Euclidean 3-space $\mathbb{R}^3$. An embedding of a graph into $\mathbb{R}^3$ is said to be linear, if it sends every edge to…
Convergence of order $O(1/\sqrt{n})$ is obtained for the distance in total variation between the Poisson distribution and the distribution of the number of fixed size cycles in generalized random graphs with random vertex weights. The…
We give explicit formulas and algorithms for the computation of the rotation number of a nullhomologous Legendrian knot on a page of a contact open book. On the way, we derive new formulas for the computation of the Thurston-Bennequin…
We construct a bosonic quantum field on a general quantum graph. Consistency of the construction leads to the calculation of the total scattering matrix of the graph. This matrix is equivalent to the one already proposed using generalized…
A simple graph $G$ is \textit{k-ordered} (respectively, \textit{k-ordered hamiltonian}), if for any sequence of $k$ distinct vertices $v_1, ..., v_k$ of $G$ there exists a cycle (respectively, hamiltonian cycle) in $G$ containing these $k$…
We determine, for all $k\geq 6$, the typical structure of graphs that do not contain an induced $2k$-cycle. This verifies a conjecture of Balogh and Butterfield. Surprisingly, the typical structure of such graphs is richer than that…
The vertices of a $k$-token graph of a graph $G$ correspond to $k$ indistinguishable tokens placed on $k$ different vertices of $G$. Changing some conditions on both the nature of the tokens and the number of tokens allowed in each vertex…
For a graph $G$, a graph cubeahedron $\square_G$ and a graph associahedron $\triangle_G$ are simple convex polytopes which admit (real) toric manifolds. In this paper, we introduce a graph invariant, called the $b$-number, and we show that…
Ozkan et al. conjectured that any packing of $n$ spheres with generic radii will be stress-free, and hence will have at most $3n-6$ contacts. In this paper we prove that this conjecture is true for any sphere packing with contact graph of…
In this paper we consider the gauge invariant third quantized model of supersymmetric group field cosmology. The supersymmetric BRST invariance for such theory in non-linear gauge is also analysed. The path integral formulation to the case…