Related papers: Planar Legendrian graphs
We study 3-random-like graphs, that is, sequences of graphs in which the densities of triangles and anti-triangles converge to 1/8. Since the random graph ${\mathcal G}_{n,1/2}$ is, in particular, 3-random-like, this can be viewed as a weak…
Let E be a circle bundle over a Riemann surface that supports a contact structure transverse to the fibers. This paper presents a combinatorial definition of a differential graded algebra (DGA) that is an invariant of Legendrian knots in E.…
We study homotopically non-trivial spheres of Legendrians in the standard contact R3 and S3. We prove that there is a homotopy injection of the contactomorphism group of S3 into some connected components of the space of Legendrians induced…
We establish that every embedding of a Grassmann graph in a polar Grassmann graph can be reduced to an embedding in a Grassmann graph or to an embedding in the collinearity graph of a polar space. Also, we consider $3$-embeddings, i.e.…
In 1968, Ringel and Youngs confirmed the last open case of the Heawood Conjecture by determining the genus of every complete graph $K_n$. In this paper, we investigate the minimum genus embeddings of the complete $3$-uniform hypergraphs…
We introduce the notion of a standard weighted graph and show that every weighted graph has an essentially unique standard model. Moreover we classify birational transformations between such models. Our central result shows that these are…
Previous work of Chan--Church--Grochow and Baker--Wang shows that the set of spanning trees in a plane graph $G$ is naturally a torsor for the Jacobian group of $G$. Informally, this means that the set of spanning trees of $G$ naturally…
We present a short proof, relaying on the divergence theorem, verifying that minimal sets in the plane are trivial.
Rigidity, arising in discrete geometry, is the property of a structure that does not flex. Laman provides a combinatorial characterization of rigid graphs in the Euclidean plane, and thus rigid graphs in the Euclidean plane have…
We prove that the complement of any non-separating planar graph of order $2n-3$ contains a $K_n$ minor, and argue that the order $2n-3$ is lowest possible with this property. To illustrate the necessity of the non-separating hypothesis, we…
Links in $S^3$ can be encoded by grid diagrams; a grid diagram is a collection of points on a toroidal grid such that each row and column of the grid contains exactly two points. Grid diagrams can be reinterpreted as front projections of…
Let $G$ be a ribbon graph. Matthew Baker and Yao Wang proved that the rotor-routing torsor and the Bernardi torsor for $G$, which are two torsor structures on the set of spanning trees for the Picard group of $G$, coincide when $G$ is…
The rotational dimension is a minor monotone graph invariant related to the dimension of an Euclidean space containing a spectral embedding corresponding to the first nonzero eigenvalue of the graph Laplacian, which is introduced by…
A graph drawing in the plane is called an almost embedding if images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. We introduce integer invariants of almost embeddings: winding number, cyclic and triodic Wu…
Consider a reductive linear algebraic group $G$ acting linearly on a polynomial ring $S$ over an infinite field; key examples are the general linear group, the symplectic group, the orthogonal group, and the special linear group, with the…
We consider 3-regular planar matchstick graphs, i.e. those which have a planar embedding such that all edge lengths are equal, with given girth g. For girth 3 it is known that such graphs exist if and only if the number of vertices n is an…
A set of geometric graphs is {\em geometric-packable} if it can be asymptotically packed into every sequence of drawings of the complete graph $K_n$. For example, the set of geometric triangles is geometric-packable due to the existence of…
Self-rational maps of generic algebraic K3 surfaces are conjectured to be trivial. We relate this conjecture to a conjecture concerning the irreducibility of the universal Severi varieties parametrizing nodal curves of given genus and…
First, we show that conjugate Lagrangian fillings, associated to plabic graphs, and Lagrangian fillings obtained as Reeb pinching sequences are both Hamiltonian isotopic to Lagrangian projections of Legendrian weaves. In general, we…
We announce results about flat (linkless) embeddings of graphs in 3-space. A piecewise-linear embedding of a graph in 3-space is called {\it flat} if every circuit of the graph bounds a disk disjoint from the rest of the graph. We have…