Related papers: Partial duality and closed 2-cell embeddings
In general terms, Gelfand duality refers to a correspondence between a geometric, topological, or analytical category, and an algebraic category. For example, in smooth differential geometry, Gelfand duality refers to the topological…
In this paper, we give a lengthy proof of a small result! A graph is bisplit if its vertex set can be partitioned into three stable sets with two of them inducing a complete bipartite graph. We prove that these graphs satisfy the…
A digraph is 2-regular if every vertex has both indegree and outdegree two. We define an embedding of a 2-regular digraph to be a 2-cell embedding of the underlying graph in a closed surface with the added property that for every…
In this article, we give a positive answer to the cycle double cover conjecture. Ones who are mainly interesting in the proof of the conjecture can only read Sections 2 and 4.
Double Bruhat cells in a semisimple group are intersections of cells in two Bruhat decompositions corresponding to two opposite Borel subgroups. They form a geometric framework for the study of total positivity in semisimple groups; they…
In this note we give two examples of partially commutative subgroups of partially commutative groups. Our examples are counterexamples to the Extension Graph Conjecture and to the Weakly Chordal Conjecture of Kim and Koberda, \cite{KK}. On…
Let $A$ be an additively cancellative semialgebra over an additively cancellative semifield $K$ as defined in [9]. For a given partial action $\alpha$ of a group $G$ on an algebra, the associativity of partial skew group ring together with…
We study characteristics which might distinguish two-graphs by introducing different numerical measures on the collection of graphs on $n$ vertices. Two conjectures are stated, one using these numerical measures and the other using the deck…
This article has been written for an educational magazine whose target audience consists of students and teachers of mathematics in universities, colleges and schools. It concerns a notion of duality between rectangles. A proof is given…
In [6] the notion of a g-cell structure was introduced as a generalization of the construction proposed by Debski and Tymchatyn to realize a certain class of topological spaces as quotient spaces of inverse limits. In [2], cell maps are…
The field of two-dimensional topological semimetals, which emerged at the intersection of two-dimensional materials and topological materials, have been rapidly developing in recent years. In this article, we briefly review the progress in…
We describe a way of assigning labels to the vertices of any undirected graph on up to $n$ vertices, each composed of $n/2+O(1)$ bits, such that given the labels of two vertices, and no other information regarding the graph, it is possible…
We investigate the extremal properties of saturated partial plane embeddings of maximal planar graphs. For a planar graph $G$, the plane-saturation number $\mathrm{sat}_{\mathcal{P}}(G)$ denotes the minimum number of edges in a plane…
Given a graph $G$ and a subset $X$ of vertices of $G$ with size at least two, we denote by $N^2_G(X)$ the set of vertices of $G$ that have at least two neighbors in $X$. We say that a bipartite graph $G$ with sides $A$ and $B$ satisfies the…
Simultaneous embedding is concerned with simultaneously representing a series of graphs sharing some or all vertices. This forms the basis for the visualization of dynamic graphs and thus is an important field of research. Recently there…
A cornerstone of geometric reconstruction, rotation averaging seeks the set of absolute rotations that optimally explains a set of measured relative orientations between them. In addition to being an integral part of bundle adjustment and…
It is shown that Euler's theorem for graphs can be generalized for 2-complexes. Two notions that generalize cycle and Eulerian tour are introduced (``circlet'' and ``Eulerian cover''), and we show that for a strongly-connected, pure…
Given a map $\mathcal M$ on a connected and closed orientable surface, the delta-matroid of $\mathcal M$ is a combinatorial object associated to $\mathcal M$ which captures some topological information of the embedding. We explore how…
A set S of vertices in a graph G is a dominating set of G if every vertex not in S is adjacent to a vertex in S . The domination number of G, denoted by $\gamma$(G), is the minimum cardinality of a dominating set in G. In a breakthrough…
In this paper we will show the existence of a face $2$-colourable biembedding of the complete graph onto an orientable surface where each face is a cycle of a fixed length $k$, for infinitely many values of $k$. In particular, under certain…