Related papers: Book embeddings of Reeb graphs

Back in the Eighties, Heath showed that every 3-planar graph is subhamiltonian and asked whether this result can be extended to a class of graphs of degree greater than three. In this paper we affirmatively answer this question for the…

Moduli spaces of Abelian and quadratic differentials are stratified by multiplicities of zeroes; connected components of the strata correspond to ergodic components of the Teichmuller geodesic flow. It is known that the strata are not…

We present a semi-supervised learning framework based on graph embeddings. Given a graph between instances, we train an embedding for each instance to jointly predict the class label and the neighborhood context in the graph. We develop…

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…

Let $(R, \sim )$ be the Rado graph, $Emb (R)$ the monoid of its self-embeddings, $\Pi (R)=\{ f[R]: f\in Emb (R)\}$ the set of copies of $R$ contained in $R$, and ${\mathcal I}_R$ the ideal of subsets of $R$ which do not contain a copy of…

This paper proposes a new, visual method to study numerical semigroups and the Frobenius problem. The method is based on building a so-called reduction graph, whose nodes usually correspond to monogenic semigroups, and whose edges can have…

A minimal separating set in a connected topological space $X$ is a subset $L \subset X$ with the property that $X \setminus L$ is disconnected, but if $L^{\prime}$ is a proper subset of $L$, then $X \setminus L^{\prime}$ is connected. Such…

This is a note on the graphs of two smooth real-valued functions in the plane with no intersection and the natural map onto the region surrounded by them with the canonical projection to the line composed, yielding its Reeb space. The Reeb…

We demonstrate that graphs embedded on surfaces are a powerful and practical tool to generate, characterize and simulate networks with a broad range of properties. Remarkably, the study of topologically embedded graphs is non-restrictive…

We show that every connected set $X$ which is irreducible between two points $a$ and $b$ embeds into the Hilbert cube in a way that $X\cup \{c\}$ is irreducible between $a$ and $b$ for every point $c$ in the closure of $X$. Also, a…

The Reeb space of a continuous map is the space of all (elements representing) connected components of preimages endowed with the quotient topology induced from the natural equivalence relation on the domain. These objects are strong tools…

This paper describes connected components of the strata of holomorphic abelian differentials on marked Riemann surfaces with prescribed degrees of zeros. Unlike the case for unmarked Riemann surfaces, we find there can be many connected…

In this paper, we focus on the classification of books using short descriptive texts (cover blurbs) and additional metadata. Building upon BERT, a deep neural language model, we demonstrate how to combine text representations with metadata…

Representation learning has recently been successfully used to create vector representations of entities in language learning, recommender systems and in similarity learning. Graph embeddings exploit the locality structure of a graph and…

We introduce the vertex-arboricity of group-labelled graphs. For an abelian group $\Gamma$, a $\Gamma$-labelled graph is a graph whose edges are labelled by elements of $\Gamma$. For an abelian group $\Gamma$ and $A\subseteq \Gamma$, the…

An embedding of a graph in a book, called book embedding, consists of a linear ordering of its vertices along the spine of the book and an assignment of its edges to the pages of the book, so that no two edges on the same page cross. The…

The quadratic embedding constant (QEC) of a finite, simple, connected graph originated from the classical work of Schoenberg [Ann. of Math., 1935] and [Trans. Amer. Math. Soc., 1938] on Euclidean distance geometry. In this article, we study…

This paper studies the zero-divisor graphs attached to several finite chain-ring families and computes the homological invariants of their edge ideals by using cochordal constructible systems. We begin with a general layered graph $C(q,L)$,…

We settle affirmatively a conjecture posed in [S. M. Hegde, Set colorings of graphs, European Journal of Combinatorics 30 (4) (2009), 986--995]: If some subsets of a set X are assigned injectively to all vertices of a complete bipartite…

A $k$-stack layout (also called a $k$-page book embedding) of a graph consists of a total order of the vertices, and a partition of the edges into $k$ sets of non-crossing edges with respect to the vertex order. The stack number (book…