Related papers: A topological menagerie
A monotone cylindrical graph is a topological graph drawn on an open cylinder with an infinite vertical axis satisfying the condition that every vertical line intersects every edge at most once. It is called simple if any pair of its edges…
We prove a discrete Jordan-Brouwer-Schoenflies separation theorem telling that a (d-1)-sphere H embedded in a d-sphere G defines two different connected graphs A,B in G such a way that the intersection of A and B is H and the union is G and…
We prove a Kauffman-Murasugi-Thistlethwaite theorem for alternating links in thickened surfaces. It states that any reduced alternating diagram of a link in a thickened surface has minimal crossing number, and any two reduced alternating…
The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving…
Monsky proved that a square cannot be dissected into an odd number of triangles of equal area. Stein conjectured that the same holds for any polygon whose edges can be paired into parallel and equal-length segments. We prove Stein's…
Topological drawings are representations of graphs in the plane, where vertices are represented by points, and edges by simple curves connecting the points. A drawing is simple if two edges intersect at most in a single point, either at a…
The slope conjecture gives a precise relation between the degree of the colored Jones polynomial of a knot and the boundary slopes of essential surfaces in the knot complement. In this note we propose a generalization of the slope…
Let $Q$ be a finite subgraph of the integer grid $G$ in the plane, and let $T$ be a set of pairs of distinct vertices in $G$, called `terminal pairs'. Escaping a subset $X\subset T\cap Q$ from $Q$ means finding edge disjoint paths from the…
A triangulation of a polygon is a subdivision of it into triangles, using diagonals between its vertices. Two different triangulations of a polygon can be related by a sequence of flips: a flip replaces a diagonal by the unique other…
Algebraic curves have a discrete analogue in finite graphs. Pursuing this analogy we prove a Torelli theorem for graphs. Namely, we show that two graphs have the same Albanese torus if and only if the graphs obtained from them by…
We give a brief survey of some known results on intrinsically linked or knotted graphs.
It is well-known that the Jones polynomial of an alternating knot is closely related to the Tutte polynomial of a special graph obtained from a regular projection of the knot. Relying on the results of Bollob\'as and Riordan, we introduce a…
In this note, we present a simple non-directed graph proof of Sharkovsky's theorem which is different from the one given in [2].
We show that if two tensor algebras of topological graphs are algebraically isomorphic, then the graphs are locally conjugate. Conversely, if the base space is at most one dimensional and the edge space is compact, then locally conjugate…
We offer a new perspective on the closed graph theorem and the open mapping theorem for separated barrelled spaces and fully complete spaces.
This paper presents a phenomenon which sometimes occurs in tetravalent bipartite locally dart-transitive graphs, called a Base Graph -- Connection Graph dissection. In this dissection, each white vertex is split into two vertices of valence…
In his PhD Thesis, E.R. Scheinerman conjectured that planar graphs are intersection graphs of line segments in the plane. This conjecture was proved with two different approaches by J. Chalopin and the author, and by the author, L.…
Menger's Theorem is a fundamental result in graph theory. It states that if in a graph $G$ with distinguished sets of terminal vertices $S$ and $T$ there are no $k$ pairwise vertex-disjoint $S$-$T$ paths, then there is a set of less than…
Random geometric graphs (RGGs) are commonly used to model networked systems that depend on the underlying spatial embedding. We concern ourselves with the probability distribution of an RGG, which is crucial for studying its random…
Stein proved that for each simple plane triangulation H there exists a partitioning of the vertex of H into two subsets each of which induces a forest if and only if the dual H^{*} has a Hamilton cycle. We extend the Stein theorem for…