Related papers: Obstructions of Connectivity 2 for Embedding Graph…
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…
What are the unavoidable induced subgraphs of graphs with large treewidth? It is well-known that the answer must include a complete graph, a complete bipartite graph, all subdivisions of a wall and line graphs of all subdivisions of a wall…
Interval graphs are intersection graphs of closed intervals. A generalization of recognition called partial representation extension was introduced recently. The input gives an interval graph with a partial representation specifying some…
Given a graph $G$, an {\em obstacle representation} of $G$ is a set of points in the plane representing the vertices of $G$, together with a set of connected obstacles such that two vertices of $G$ are joined by an edge if and only if the…
An obstacle representation of a graph is a mapping of the vertices onto points in the plane and a set of connected regions of the plane (called obstacles) such that the straight-line segment connecting the points corresponding to two…
For every Sol manifold $M$, we determine the $\mathbb{Z}_2$-Thurston norm of every element in $H_2(M;\mathbb{Z}_2)$. Each Sol manifold is either a torus bundle over the circle or a torus semi-bundle, thus corresponds to a torus map. We…
A labelled, undirected graph is a graph whose edges have assigned labels, from a specific set. Given a labelled, undirected graph, the well-known minimum labelling spanning tree problem is aimed at finding the spanning tree of the graph…
For certain bordered submanifolds $M\subset\CC^2$ we show that $M$ can be embedded properly and holomorphically into $\CC^2$. An application is that any subset of a torus with two boundary components can be embedded properly into $\CC^2$.
In this paper, all finite groups whose commuting (non-commuting) graphs can be embed on the plane, torus or projective plane are classified.
We develop a complete obstruction theory for the $\mathbb{Z}_2$-index of a compact connected 4-dimensional manifold with free involution. This $\mathbb{Z}_2$-index, equal to the minimum integer $n$ for which there exists an equivariant map…
We find a new obstruction to the principal graphs of subfactors. It shows that in a certain family of 3-supertransitive principal graphs, there must be a cycle by depth 6, with one exception, the principal graph of the Haagerup subfactor.
An obstacle representation of a graph $G$ consists of a set of polygonal obstacles and a drawing of $G$ as a visibility graph with respect to the obstacles: vertices are mapped to points and edges to straight-line segments such that each…
We consider the problem of deciding whether an input graph G admits a topological embedding into a two-dimensional simplicial complex C. This problem includes, among others, the embeddability problem of a graph on a surface and the…
An obstacle representation of a graph $G$ consists of a set of pairwise disjoint simply-connected closed regions and a one-to-one mapping of the vertices of $G$ to points such that two vertices are adjacent in $G$ if and only if the line…
In recent years, discrete spaces such as graphs attract much attention as models for physical spacetime or as models for testing the spirit of non-commutative geometry. In this work, we construct the differential algebras for graphs by…
A graph is a cograph if it does not contain a 4-vertex path as an induced subgraph. An $(s, k)$-polar partition of a graph $G$ is a partition $(A, B)$ of its vertex set such that $A$ induces a complete multipartite graph with at most $s$…
Determining which bipartite graphs can be principal graphs of subfactors is an important and difficult question in subfactor theory. Using only planar algebra techniques, we prove a triple point obstruction which generalizes all known…
If $M$ is an $m \times m$ matrix over $\{ 0, 1, \ast \}$, an $M$-partition of a graph $G$ is a partition $(V_1, \dots V_m)$ such that $V_i$ is completely adjacent (non-adjacent) to $V_j$ if $M_{ij} = 1$ ($M_{ij} = 0$), and there are no…
We develop a structural approach to simultaneous embeddability in temporal sequences of graphs, inspired by graph minor theory. Our main result is a classification theorem for 2-connected temporal sequences: we identify five obstruction…
This paper considers *-graphs in which all vertices have degree 4 or 6, and studies the question of calculating the genus of orientable 2-surfaces into which such graphs may be embedded. A *-graph is a graph endowed with a formal adjacency…