Related papers: On Legendrian Graphs

We say that a graph $G$ has an {\em odd $K_4$-subdivision} if some subgraph of $G$ is isomorphic to a $K_4$-subdivision and whose faces are all odd holes of $G$. For a number $\ell\geq 2$, let $\mathcal{G}_{\ell}$ denote the family of…

We present an atlas of Legendrian knots in standard contact three-space. This gives a conjectural Legendrian classification for all knots with arc index at most 9, including alternating knots through 7 crossings and nonalternating knots…

For all integers $4 \leq r \leq d$, we show that there exists a finite simple graph $G= G_{r,d}$ with toric ideal $I_G \subset R$ such that $R/I_G$ has (Castelnuovo-Mumford) regularity $r$ and $h$-polynomial of degree $d$. To achieve this…

We classify rotary (orientably-regular) maps whose underlying graphs are multicycles. For the multicycle $\mathrm{C}_n^{(\lambda)}$ of length $n$ and edge-multiplicity $\lambda$, we determine all rotary embeddings for $n\geqslant 3$ and…

We classify Legendrian rational unknots with tight complements in the lens spaces L(p,1) up to coarse equivalence. As an example of the general case, this classification is also worked out for L(5,2). The knots are described explicitly in a…

We construct new unbounded invariant distances on the universal cover of certain Legendrian isotopy classes. This is the first instance where unboundedness of an invariant distance is obtained without assuming the existence of a positive…

Let $F$ and $G$ be simple finite oriented graphs (without symmetric arcs). A graph $G$ is called $F$-irregular if any two distinct vertices in $G$ belong to a different number of subgraphs of $G$ isomorphic to $F$. In this paper, we…

For two integers $k$ and $\ell$, an $(\ell \text{ mod }k)$-cycle means a cycle of length $m$ such that $m\equiv \ell\pmod{k}$. In 1977, Bollob\'{a}s proved a conjecture of Burr and Erd\H{o}s by showing that if $\ell$ is even or $k$ is odd,…

A graph $G$ is called an $L_1$-graph if $d(u)+d(v)\ge|N(u)\cup N(v)\cup N(w)|-1$ for every triple of vertices $u,v,w$ where $u$ and $v$ are at distance 2 and $w\in N(u)\cap N(v)$. Asratian et al. (1996) proved that all finite connected…

We prove that the LOSS and GRID invariants of Legendrian links in knot Floer homology behave in certain functorial ways with respect to decomposable Lagrangian cobordisms in the symplectization of the standard contact structure on…

A simple graph more often than not contains adjacent vertices with equal degrees. This in particular holds for all pairs of neighbours in regular graphs, while a lot such pairs can be expected e.g. in many random models. Is there a…

A well-known conjecture of Stanley is that the h-vector of a matroid is a pure O-sequence. There have been numerous papers with partial progress on this conjecture, but it is still wide open. In particular, for graphic matroids coming from…

We consider S^1-families of Legendrian knots in the standard contact R^3. We define the monodromy of such a loop, which is an automorphism of the Chekanov-Eliashberg contact homology of the starting (and ending) point. We prove this…

We show that for any Legendrian link $L$ in the $1$-jet space of $S^1$ the $2$-graded ruling polynomial, $R^2_L(z)$, is determined by the Thurston-Bennequin number and the HOMFLY-PT polynomial. Specifically, we recover $R^2_L(z)$ as a…

We construct a family of countexamples to a conjecture of Galvin [5], which stated that for any $n$-vertex, $d$-regular graph $G$ and any graph $H$ (possibly with loops), \[\hom(G,H) \leq \max\left\lbrace\hom(K_{d,d}, H)^{\frac{n}{2d}},…

We study the behavior of Legendrian and transverse knots under the operation of connected sums. As a consequence we show that there exist Legendrian knots that are not distinguished by any known invariant. Moreover, we classify Legendrian…

A nut graph is a nontrivial simple graph whose adjacency matrix contains a one-dimensional null space spanned by a vector without zero entries. Moreover, an $\ell$-circulant graph is a graph that admits a cyclic group of automorphisms…

Properties of general Legendrian cycles $T$ acting in ${\mathbb R}^d\times S^{d-1}$ are studied. In particular, we give short proofs for certain uniqueness theorems with respect to the projections on the first and second component of such…

We study how few pairwise distinct longest cycles a regular graph can have under additional constraints. For each integer $r \geq 5$, we give exponential improvements for the best asymptotic upper bounds for this invariant under the…

Every null-homologous link in an oriented 3-manifold is isotopic to the boundary of a ribbon of a Legendrian graph for any overtwisted contact structure. However this is not the case if the boundary is required to be non-loose. Here, we…