Related papers: Legendrian theta-graphs
In this article we introduce a definition of k-uniform thresholds hypergraphs through a binary sequence, a natural extension of the classical definition for thresholds graphs. We characterize some of its eigenvalues and multiplicities by…
Temperley-Lieb algebras have been generalized to sl(3) web spaces. Since a cubic bipartite planar graph with suitable directions on edges is a web, the quantum sl(3) invariants naturally extend to all cubic bipartite planar graphs. First we…
A $d$-regular graph on $n$ nodes has at most $T_{\max} = \frac{n}{3} \tbinom{d}{2}$ triangles. We compute the leading asymptotics of the probability that a large random $d$-regular graph has at least $c \cdot T_{\max}$ triangles, and…
Thomassen conjectured that triangle-free planar graphs have an exponential number of $3$-colorings. We show this conjecture to be equivalent to the following statement: there exists a positive real $\alpha$ such that whenever $G$ is a…
We establish tight lower and upper bounds on the number of edges in traceable graphs in several classes of dense graphs. A graph is traceable if it has a Hamiltonian path. We show that the bound is: - quadratic for the class of graphs of…
For a given positive integer t we consider graphs having maximal independent sets of precisely t distinct cardinalities and restrict our attention to those that have no vertices of degree one. In the situation when t is four or larger and…
Tetrad correlations were obtained historically for Gaussian distributions when tasks are designed to measure an ability or attitude so that a single unobserved variable may generate the observed, linearly increasing dependences among the…
This paper introduces two constructions of Legendrian submanifolds, called the Legendrian product and spinning, and computes their classical invariants, the Thurston-Bennequin invariant and the Maslov class, in R^{2n+1}. These constructions…
We prove that, given a finite graph $\Sigma$ satisfying some mild conditions, there exist infinitely many tetravalent half-arc-transitive normal covers of $\Sigma$. Applying this result, we establish the existence of infinite families of…
In this note we study Legendrian and transverse knots in the knot type of a (p,q)-cable of a knot K in 3-sphere. We give two structural theorems that describe when the (p,q)-cable of a Legendrian simple knot type K is also Legendrian…
We give new functions of Legendrian knots derived from Legendrian fronts. These are integer-valued linear functions that are alike the Arnold basic invariant of plane curves. Various generalizations of the Arnold basic invariant have been…
A graph is said to be edge-transitive if its automorphism group acts transitively on its edges. It is known that edge-transitive graphs are either vertex-transitive or bipartite. In this paper we present a complete classification of all…
Extending the work of Godsil and others, we investigate the notion of the inverse of a graph (specifically, of bipartite graphs with a unique perfect matching). We provide a concise necessary and sufficient condition for the invertibility…
Twisted trilayer graphene (TLG) may be the simplest realistic system so far, which has flat bands with nontrivial topology. Here, we give a detailed calculation about its band structures and the band topology, i.e. valley Chern number of…
In this paper, we define the set of singular grid diagrams $\mathcal{SG}$ which provides a unified description for singular links, singular Legendrian links, singular transverse links, and singular braids. We also classify the complete set…
The Burning Number Conjecture, that a graph on $n$ vertices can be burned in at most $\lceil \sqrt{n} \ \rceil$ rounds, has been of central interest for the past several years. Much of the literature toward its resolution focuses on two…
A graph $G$ is {\it $n$-existentially closed} if, for all disjoint sets of vertices $A$ and $B$ with $|A\cup B|=n$, there is a vertex $z$ not in $A\cup B$ adjacent to each vertex of $A$ and to no vertex of $B$. In this paper, we investigate…
An octilinear drawing of a planar graph is one in which each edge is drawn as a sequence of horizontal, vertical and diagonal at 45 degrees line-segments. For such drawings to be readable, special care is needed in order to keep the number…
We generalize the concept of token graphs to obtain supertoken graphs. In the latter case, there can be more than one token in a vertex. We formally define supertoken graphs and establish their basic properties. Moreover, we provide some…
We investigate the ramifications of the Legendrian satellite construction on the relation of Lagrangian cobordism between Legendrian knots. Under a simple hypothesis, we construct a Lagrangian concordance between two Legendrian satellites…