相关论文: Ravels arising from Montesinos Tangles

Let $R$ be the field of real Puiseux series. It is a real closed field. We construct the first examples of smooth intersections of two quadrics in $\mathbb{P}_R^5$ and smooth cubic hypersurfaces in $\mathbb{P}_R^4$ which are not stably…

We say that a graph is intrinsically non-trivial if every spatial embedding of the graph contains a non-trivial spatial subgraph. We prove that an intrinsically non-trivial graph is intrinsically linked, namely every spatial embedding of…

The Ramsey's theorem says that a graph with sufficiently many vertices contains a clique or stable set with many vertices. Now we attach some parameter to every vertex, such as degree. Consider the case a graph with sufficiently many…

The set of matrix tuples with invariant subspaces whose dimensions sum up to the dimension of the space, but which do not span the whole space form an algebraic hypersurface. We found the equation of this hypersurface. This generalizes…

A plane graph is called a rectangular graph if each of its edges can be oriented either horizontally or vertically, each of its interior regions is a four-sided region and all interior regions can be fitted in a rectangular enclosure. Only…

A graph is $\ell$-reconstructible if it is determined by its multiset of induced subgraphs obtained by deleting $\ell$ vertices. We prove that $3$-regular graphs are $2$-reconstructible.

Splines can be constructed by convolving the indicator function of a cell whose shifts tessellate $\R^k$. This paper presents simple, non-algebraic criteria that imply that, for regular shift-invariant tessellations, only a small subset of…

A graph is closed when its vertices have a labeling by [n] with a certain property first discovered in the study of binomial edge ideals. In this article, we prove that a connected graph has a closed labeling if and only if it is chordal,…

One of the most important characteristics of a quantum graph is the average density of resonances, $\rho = \frac{\mathcal{L}}{\pi}$, where $\mathcal{L}$ denotes the length of the graph. This is a very robust measure. It does not depend on…

A wheel is a graph that consists of a chordless cycle of length at least 4 plus a vertex with at least three neighbors on the cycle. It was shown recently that detecting induced wheels is an NP-complete problem. In contrast, it is shown…

Graph products are characterized by the existence of non-trivial equivalence relations on the edge set of a graph that satisfy a so-called square property. We investigate here a generalization, termed RSP-relations. The class of graphs with…

It is shown that every 2-planar graph is quasiplanar, that is, if a simple graph admits a drawing in the plane such that every edge is crossed at most twice, then it also admits a drawing in which no three edges pairwise cross. We further…

A 2-dimensional framework is a straight line realisation of a graph in the Euclidean plane. It is radically solvable if the set of vertex coordinates is contained in a radical extension of the field of rationals extended by the squared edge…

A thrackle is a drawing of a graph in which each pair of edges meets precisely once. Conway's Thrackle Conjecture asserts that a planar thrackle drawing of a graph cannot have more edges than vertices, which is equivalent to saying that no…

A graph is $\ell$-reconstructible if it is determined by its multiset of induced subgraphs obtained by deleting $\ell$ vertices. We prove that strongly regular graphs with at least six vertices are $2$-reconstructible.

The Burling sequence is a sequence of triangle-free graphs of increasing chromatic number. Any graph which is an induced subgraph of a graph in this sequence is called a Burling graph. These graphs have attracted some attention because they…

We develop a systematical way of constructing S-Ricci flat graphs which are not Abelian Cayley via graph bundle with explicit examples. For this purpose, we prove that, with some natural constrains, a non-trivial graph bundle can not be…

A visibility representation is a classical drawing style of planar graphs. It displays the vertices of a graph as horizontal vertex-segments, and each edge is represented by a vertical edge-segment touching the segments of its end vertices;…

A \emph{thrackle} is a graph drawn in the plane so that every pair of its edges meet exactly once, either at a common end vertex or in a proper crossing. Conway's thrackle conjecture states that the number of edges is at most the number of…

Graphs are a basic tool for the representation of modern data. The richness of the topological information contained in a graph goes far beyond its mere interpretation as a one-dimensional simplicial complex. We show how topological…