Related papers: Linear embeddings of $K_9$ are triple linked
Many mathematical models have been leveraged to design embeddings for representing Knowledge Graph (KG) entities and relations for link prediction and many downstream tasks. These mathematically-inspired models are not only highly scalable…
We show that finding orthogonal grid-embeddings of plane graphs (planar with fixed combinatorial embedding) with the minimum number of bends in the so-called Kandinsky model (which allows vertices of degree $> 4$) is NP-complete, thus…
Let $M$ be a 3-connected binary matroid and let $Y(M)$ be the set of elements of $M$ avoiding at least $r(M)+1$ non-separating cocircuits of $M$. Lemos proved that $M$ is non-graphic if and only if $Y(M)\neq\emp$. We generalize this result…
We introduce and study embeddings of graphs in finite projective planes, and present related results for some families of graphs including complete graphs and complete bipartite graphs. We also make connections between embeddings of graphs…
A graph G is weakly 4-connected if it is 3-connected, has at least five vertices, and for every pair of sets (A,B) with union V(G) and intersection of size three such that no edge has one end in A-B and the other in B-A, one of the induced…
We show that 4-connected plane triangulations can be redrawn such that edges are represented by straight segments and the vertices are covered by a set of at most $\sqrt{2n}$ lines each of them horizontal or vertical. The same holds for all…
We introduce a new class of matroids, called graph curve matroids. A graph curve matroid is associated to a graph and defined on the vertices of the graph as a ground set. We prove that these matroids provide a combinatorial description of…
A link diagram can be considered as a $4$-valent graph embedded in the $2$-sphere and divides the sphere into complementary regions. In this paper, we show that any link has a diagram with only triangles and quadrilaterals. This extends…
We prove that a connected graph contains a circuit---a closed walk that repeats no edges---through any $k$ prescribed edges if and only if it contains no odd cut of size at most $k$.
We show that every graph admits a canonical tree-like decomposition into its $k$-edge-connected pieces for all $k\in\mathbb{N}\cup\{\infty\}$ simultaneously.
In this paper we discuss the connected components of underlying graphs of halving lines' configurations. We show how to create a configuration whose underlying graph is the union of two given underlying graphs. We also prove that every…
We prove that for any finite tree $T$ with $n$ vertices and maximal degree $3$, there is a topological embedding of $T$ into the integer grid $Z^2$ which maps vertices to vertices and whose image meets at most $\frac{7}{3}n$ vertices. This…
In this paper we study $k$-noncrossing matchings. A $k$-noncrossing matching is a labeled graph with vertex set $\{1,...,2n\}$ arranged in increasing order in a horizontal line and vertex-degree 1. The $n$ arcs are drawn in the upper…
The Tutte polynomial of a connected graph was originally defined by Tutte as a sum over all spanning trees of monomials depending on a fixed linear order on the set of edges. Tuttle proved that while these monomials do depend on the linear…
A graph $G$ has a $k$-page book embedding if $G$ can be embedded into a $k$-page book. The minimum $k$ such that $G$ has a $k$-page book embedding is the book thickness of $G$, denoted $bt(G)$. Most of the work on this subject has been done…
We determine for which $m$, the complete graph $K_m$ has an embedding in $S^3$ whose topological symmetry group is isomorphic to one of the polyhedral groups: $A_4$, $A_5$, or $S_4$.
Diagrams enable the use of various algebraic and geometric tools for analysing and classifying knots. In this paper we introduce a new diagrammatic representation of triply periodic entangled structures (TP tangles), which are embeddings of…
A graph $G$ on $m$ vertices is pancyclic if it contains cycles of length $l$, $3\leq l \leq m$ as subgraphs in $G$. The complete graph $K_{9}$ on 9 vertices with a cycle $C_{9}$ of length 9 deleted from $K_{9}$ is denoted by…
Hartsfield and Ringel constructed orientable quadrangular embeddings of the complete graph $K_n$ for $n\equiv 5 \pmod 8$, and nonorientable ones for $n \ge 9$ and $n\equiv 1 \pmod 4$. These provide minimal quadrangulations of their…
We give a characterization of the internally 4-connected binary matroids that have no minor isomorphic to M(K3,3). Any such matroid is either cographic, or is isomorphic to a particular single-element extension of the bond matroid of a…