Related papers: Bidimensionality of Geometric Intersection Graphs

High-dimensional multiplex graphs are characterized by their high number of complementary and divergent dimensions. The existence of multiple hierarchical latent relations between the graph dimensions poses significant challenges to…

For a finite group $G$, we define the inclusion graph of subgroups of $G$, denoted by $\mathcal I(G)$, is a graph having all the proper subgroups of $G$ as its vertices and two distinct vertices $H$ and $K$ in $\mathcal I(G)$ are adjacent…

For a given hypergraph, an orientation can be assigned to the vertex-edge incidences. This orientation is used to define the adjacency and Laplacian matrices. In addition to studying these matrices, several related structures are…

Learning faithful graph representations as sets of vertex embeddings has become a fundamental intermediary step in a wide range of machine learning applications. The quality of the embeddings is usually determined by how well the geometry…

We define and investigate a geometric object, called an associative geometry, corresponding to an associative algebra (and, more generally, to an associative pair). Associative geometries combine aspects of Lie groups and of generalized…

We define and investigate a geometric object, called an associative geometry, corresponding to an associative algebra (and, more generally, to an associative pair). Associative geometries combine aspects of Lie groups and of generalized…

Graph convexity has been used as an important tool to better understand the structure of classes of graphs. Many studies are devoted to determine if a graph equipped with a convexity is a {\em convex geometry}. In this work we survey…

We develop a notion of a dual of a graph, generalizing the definition of Goulden and Yong (which only applied to trees), and reproving their main result using our new notion. We in fact give three definitions of the dual: a graph-theoretic…

A graph $G$ is geodetic if between any two vertices there exists a unique shortest path. In 1962 Ore raised the challenge to characterize geodetic graphs, but despite many attempts, such characterization still seems well beyond reach. We…

We prove upper bounds for the Morse index and number of intersections of min-max geodesics achieving the $p$-widths of a closed surface. A key tool in our analysis is a proof that for a generic set of metrics, the tangent cone at any vertex…

A general model for geometric structures on differentiable manifolds is obtained by deforming infinitesimal symmetries. Specifically, this model consists of a Lie algebroid, equipped with an affine connection compatible with the Lie…

Diestel and M\"uller showed that the connected tree-width of a graph $G$, i.e., the minimum width of any tree-decomposition with connected parts, can be bounded in terms of the tree-width of $G$ and the largest length of a geodesic cycle in…

We define a special case of tree decompositions for planar graphs that respect a given embedding of the graph. We study the analogous width of the resulting decomposition we call the embedded-width of a plane graph. We show both upper…

Graph-based collaborative filtering is capable of capturing the essential and abundant collaborative signals from the high-order interactions, and thus received increasingly research interests. Conventionally, the embeddings of users and…

Classically, B\'ezout's theorem says that an intersection of hypersurfaces in a projective space is rationally equivalent to a number of copies of a smaller projective space, the number depending on the degrees of the hypersurfaces. We give…

We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or…

Characterized are all simple undirected graphs $G$ such that any real symmetric matrix that has graph $G$ has no eigenvalues of multiplicity more than 2. All such graphs are partial 2-trees (and this follows from a result for rather general…

We show that a geodesic metric space is hyperbolic in the sense of Gromov if and only if intersections of balls have bounded eccentricity. In particular, $\R$-trees are characterized among geodesic metric spaces by the property that the…

The intersection graph of a group $G$ is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper non-trivial subgroups of $G$, and there is an edge between two distinct vertices $H$…

We uncover a connection between two seemingly unrelated notions: lettericity, from structural graph theory, and geometric griddability, from the world of permutation patterns. Both of these notions capture important structural properties of…