相关论文: The total Thurston-Bennequin number of complete an…
This article reviews the development of Legendrian graph theory in the standard contact 3-sphere ($S^3, \xi_{std}$). We provide a generalized criterion under which the total Thurston-Bennequin invariant of a Legendrian graph (sum of tb of…
We establish a relation between several easy-to-calculate numerical invariants of generic knots in $\mathbb{H}^2 \times S^1$, and use it to give a new method of computing the Thurston-Bennequin number of Legendrian knots in the tight…
We investigate Legendrian graphs in $(\R^3, \xi_{std})$. We extend the classical invariants, Thurston-Bennequin number and rotation number to Legendrian graphs. We prove that a graph can be Legendrian realized with all its cycles Legendrian…
We enumerate labelled and unlabelled Hamiltonian cycles in complete $n$-partite graphs $K_{d,d,\ldots,d}$ having exactly $d$ vertices in each part (in other words, Tur\'an graphs $T(nd, n))$. We obtain recurrence relations that allow us to…
In this article we give necessary and sufficient conditions for two triples of integers to be realized as the Thurston-Bennequin number and the rotation number of a Legendrian theta-graph with all cycles unknotted. We show that these…
A new complete invariant for acyclic graphs is presented
In this article, we consider the maximal value of the Thurston--Bennequin invariant of Legendrian knots which topologically represent a fixed knot type in the standard contact 3-space and we prove a formula of the value under the connected…
Theory is developed for linear-quadratic at infinity generating families for Legendrian knots in R^3. It is shown that the unknot with maximal Thurston--Bennequin invariant of -1 has a unique linear-quadratic at infinity generating family,…
The main contribution of this paper is a formula for the number of acyclic orientations of a complete bipartite, $K_{n_1,n_2},$ revealing that it is equal to the poly-Bernoulli number $B_{n_1}^{(-n_2)}$ introduced in 1997 by Kaneko. We also…
Using a knot concordance invariant from the Heegaard Floer theory of Ozsvath and Szabo, we obtain new bounds for the Thurston-Bennequin and rotation numbers of Legendrian knots in S^3. We also apply these bounds to calculate the knot…
The Thurston-Bennequin invariant provides one notion of self-linking for any homologically-trivial Legendrian curve in a contact three-manifold. Here we discuss related analytic notions of self-linking for Legendrian knots in Euclidean…
In a recent paper (2024) M. Buratti and M.E:Muzychuck have established some lower bounds on the number of non isomorphic cyclic Steiner Triple Systems of order $v\equiv 1$ (mod $6$). We complete their result to the case $v\equiv 3$ (mod…
For an odd integer $k$, let $\mathcal{C}_k = \{C_3,C_5,...,C_k\}$ denote the family of all odd cycles of length at most $k$ and let $\mathcal{C}$ denote the family of all odd cycles. Erd\H{o}s and Simonovits \cite{ESi1} conjectured that for…
In this paper, we introduce a magneto-spectral invariant for finite graphs. This invariant vanishes on trees and is maximized by complete graphs. We compute this invariant for cycles, complete graphs, wheel graphs, hypercubes, complete…
We introduce and study strongly invertible Legendrian links in the standard contact three-dimensional space. We establish the equivariant analogs of basic results separately well-known for strongly invertible and Legendrian links, i.e. the…
We give explicit formulas and algorithms for the computation of the Thurston-Bennequin invariant of a nullhomologous Legendrian knot on a page of a contact open book and on contact Heegaard surfaces. Furthermore, we extend the results to…
We determine for which $n$, the complete bipartite graph $K_{n,n}$ has an embedding in $S^3$ whose topological symmetry group is isomorphic to one of the polyhedral groups: $A_4$, $A_5$, or $S_4$.
Building on previous work by Cameron et al. in [3], we give a recurrence for computing the number of acyclic orientations of complete $k$-partite graphs, which can be implemented to obtain a dynamic programming algorithm running in time…
Using the theory of combinatorial species, we compute the cycle index for bipartite graphs, which we use to count unlabeled bipartite graphs and bipartite blocks.
We compute the Orchard crossing number, which is defined in a similar way to the rectilinear crossing number, for the complete bipartite graphs K_{n,n}.