Related papers: Legendrian theta-graphs
There are two particular $\Theta_6$-graphs - the 6-cycle graphs with a diagonal. We find the planar Tur\'an number of each of them, i.e. the maximum number of edges in a planar graph $G$ of $n$ vertices not containing the given $\Theta_6$…
In this paper, we introduce \textit{graph-pretzel links}, a generalization of classical pretzel links based on spatial graph projections. As our main result, we investigate a subfamily associated with the complete graph on four vertices to…
By examining knot Floer homology, we extend a result of Ozsv\'ath and Stipsicz and show further infinitely many Legendrian and transversely non-simple knot types among two-bridge knots. We give sufficient conditions of Legendrian and…
For a knot $K$ the cube number is a knot invariant defined to be the smallest $n$ for which there is a cube diagram of size $n$ for $K$. There is also a Legendrian version of this invariant called the \emph{Legendrian cube number}. We will…
The bondage number of a graph is the smallest number of its edges whose removal results in a graph having a larger domination number. We provide constant upper bounds for the bondage number of graphs on topological surfaces, improve upper…
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…
A graph is $1$-planar, if it can be drawn in the plane such that there is at most one crossing on every edge. It is known, that $1$-planar graphs have at most $4n-8$ edges. We prove the following odd-even generalization. If a graph can be…
We classify Legendrian unknots in overtwisted contact structures on $S^3$. In particular, we show that up to contact isotopy for every pair $(n,\pm(n-1))$ with $n>0$ there are exactly two oriented non-loose Legendrian unknots in $S^3$ with…
In this paper, we introduce two families of planar and self-similar graphs which have small-world properties. The constructed models are based on an iterative process where each step of a certain formulation of modules results in a final…
Steinberg and Tovey proved that every n-vertex planar triangle-free graph has an independent set of size at least (n+1)/3, and described an infinite class of tight examples. We show that all n-vertex planar triangle-free graphs except for…
We use parameterized Morse theory on the pages of an open book decomposition to efficiently encode the contact topology in terms of a labelled graph on a disjoint union of tori (one per binding component). This construction allows us to…
All knots in $R^3$ possess Seifert surfaces, and so the classical Thurston-Bennequin and rotation (or Maslov) invariants for Legendrian knots in a contact structure on $R^3$ can be defined. The definitions extend easily to null-homologous…
Two isomorphic graphs can have inequivalent spatial embeddings in 3-space. In this way, an isomorphism class of graphs contains many spatial graph types. A common way to measure the complexity of a spatial graph type is to count the minimum…
This work concerns results on conditions guaranteeing that certain banded $M$-matrices have banded inverses. As a first goal, a graph theoretic characterization for an off-diagonal entry of the inverse of an $M$-matrix to be positive, is…
A bound on consecutive clique numbers of graphs is established. This bound is evaluated and shown to often be much better than the bound of the Kruskal-Katona theorem. A bound on non-consecutive clique numbers is also proven.
The well-known 1-2-3 Conjecture asserts that the edges of every graph without an isolated edge can be weighted with $1$, $2$ and $3$ so that adjacent vertices receive distinct weighted degrees. This is open in general. We prove that every…
Tuza famously conjectured in 1981 that in a graph without k+1 edge-disjoint triangles, it suffices to delete at most 2k edges to obtain a triangle-free graph. The conjecture holds for graphs with small treewidth or small maximum average…
We give an explicit formula to compute the rotation number of a nullhomologous Legendrian knot in contact (1/n)-surgery diagrams along Legendrian links and obtain a corresponding result for the self-linking number of transverse knots.…
We introduce a new ``Winding Number Conjecture'' about maps from the $(d-1)$-skeleton of the $((d+1)(q-1))$-simplex into $\real^d$. This conjecture is equivalent to the Topological Tverberg Theorem. Furthermore, many statements about the…
In this article we define Lagrangian concordance of Legendrian knots, the analogue of smooth concordance of knots in the Legendrian category. In particular we study the relation of Lagrangian concordance under Legendrian isotopy. The focus…