English
Related papers

Related papers: Planar Legendrian $\Theta$-graphs

200 papers

If $\Gamma$ is a graph for which every edge is in exactly one clique of order $\omega$, then one can form a new graph with vertex set equal to these cliques. This is a generalization of the line graph of $\Gamma$. We discover many general…

Combinatorics · Mathematics 2026-05-25 Connor Phillips

Let $\mathcal{E}$ be a $\mathbb{Q}$-isogeny class of elliptic curves defined over $\mathbb{Q}$. The isogeny graph associated to $\mathcal{E}$ is a graph which has a vertex for each element of $\mathcal{E}$ and an edge for each…

Number Theory · Mathematics 2022-05-23 Garen Chiloyan

We prove a neighbourhood theorem for arbitrary knots in contact 3-manifolds. As an application we show that two topologically isotopic Legendrian knots in a contact 3-manifold become Legendrian isotopic after suitable stabilisations.

Symplectic Geometry · Mathematics 2011-12-08 Hansjörg Geiges , Fan Ding

Let L be a Legendrian knot in R^3 with the standard contact structure. In [10], a map was constructed from equivalence classes of Morse complex sequences for L, which are combinatorial objects motivated by generating families, to homotopy…

Symplectic Geometry · Mathematics 2016-01-27 Michael B. Henry , Dan Rutherford

A graph is said to be globally rigid if almost all embeddings of the graph's vertices in the Euclidean plane will define a system of edge-length equations with a unique (up to isometry) solution. In 2007, Jackson, Servatius and Servatius…

Combinatorics · Mathematics 2024-01-29 Sean Dewar

The celebrated theorem of Robertson and Seymour states that in the family of minor-closed graph classes, there is a unique minimal class of graphs of unbounded tree-width, namely, the class of planar graphs. In the case of tree-width, the…

Combinatorics · Mathematics 2017-02-01 A. Collins , J. Foniok , N. Korpelainen , V. Lozin , V. Zamaraev

Computing a morph between two drawings of a graph is a classical problem in computational geometry and graph drawing. While this problem has been widely studied in the context of planar graphs, very little is known about the existence of…

Computational Geometry · Computer Science 2021-05-28 Patrizio Angelini , Michael A. Bekos , Fabrizio Montecchiani , Maximilian Pfister

We prove that the class of topological knot types that are both Legendrian simple and satisfy the uniform thickness property (UTP) is closed under cabling. An immediate application is that all iterated cabling knot types that begin with…

Geometric Topology · Mathematics 2016-01-20 Douglas J. LaFountain

We construct the first infinite families of locally arc transitive graphs with the property that the automorphism group has two orbits on vertices and is quasiprimitive on exactly one orbit, of twisted wreath type. This work contributes to…

Combinatorics · Mathematics 2022-03-01 Eda Kaja , Luke Morgan

The Gamma-Theta Conjecture states that if the domination number of a graph is equal to its eternal domination number, then it is also equal to its clique covering number. This conjecture is known to be true for several graph classes, such…

Combinatorics · Mathematics 2025-07-01 Dmitrii Taletskii

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…

Symplectic Geometry · Mathematics 2020-04-03 Viktória Földvári

Graph transformations definable in logic can be described using the notion of transductions. By understanding transductions as a basic embedding mechanism, which captures the possibility of encoding one graph in another graph by means of…

Combinatorics · Mathematics 2025-01-09 Michał Pilipczuk

While orthogonal drawings have a long history, smooth orthogonal drawings have been introduced only recently. So far, only planar drawings or drawings with an arbitrary number of crossings per edge have been studied. Recently, a lot of…

We suggest two related conjectures dealing with the existence of spanning irregular subgraphs of graphs. The first asserts that any $d$-regular graph on $n$ vertices contains a spanning subgraph in which the number of vertices of each…

Combinatorics · Mathematics 2021-08-09 Noga Alon , Fan Wei

In earlier papers, we showed a decomposition of 2-diregular digraphs (2-dds) and used it to provide some sufficient conditions for these graphs to be non-Hamiltonian; we also showed a close connection between the permanent and determinant…

Combinatorics · Mathematics 2025-07-30 Munagala V. S. Ramanath

A drawing in the plane ($\mathbb{R}^2$) of a graph $G=(V,E)$ equipped with a function $\gamma: V \rightarrow \mathbb{N}$ is \emph{$x$-bounded} if (i) $x(u) <x(v)$ whenever $\gamma(u)<\gamma(v)$ and (ii) $\gamma(u)\leq\gamma(w)\leq…

Computational Geometry · Computer Science 2016-10-25 Radoslav Fulek

We define a nontrivial mod 2 valued additive concordance invariant defined on the torsion subgroup of the knot concordance group using involutive knot Floer package. For knots not contained in its kernel, we prove that their iterated…

Geometric Topology · Mathematics 2022-07-26 Sungkyung Kang , JungHwan Park

In this article it is proved that the dynamical properties of a broad class of semilinear parabolic problems are sensitive to arbitrarily small but smooth perturbations of the nonlinear term, when the spatial dimension is either equal to…

Analysis of PDEs · Mathematics 2018-01-22 Mickael D. Chekroun

Consider an ergodic unimodular random one-ended planar graph $\G$ of finite expected degree. We prove that it has an isometry-invariant locally finite embedding in the Euclidean plane if and only if it is invariantly amenable. By "locally…

Probability · Mathematics 2021-10-27 Itai Benjamini , Adam Timar

In this note, we first classify all topological torus knots lying on the Heegaard torus in lens spaces, and then we study Legendrian representatives of these knots. We classify oriented positive Legendrian torus knots in the universally…

Geometric Topology · Mathematics 2017-10-02 Sinem Onaran
‹ Prev 1 3 4 5 6 7 10 Next ›