Related papers: Topological Symmetry Groups of Complete Bipartite …
Let $G$ be a group and $L(G)$ be the set of all subgroups of $G$. We introduce a bipartite graph $\mathcal{B}(G)$ on $G$ whose vertex set is the union of two sets $G \times G$ and $L(G)$, and two vertices $(a, b) \in G \times G$ and $H \in…
We study model geometries of finitely generated groups. If a finitely generated group does not contain a non-trivial finite rank free abelian commensurated subgroup, we show any model geometry is dominated by either a symmetric space of…
A simple topological graph T = (V(T), E(T)) is a drawing of a graph in the plane where every two edges have at most one common point (an endpoint or a crossing) and no three edges pass through a single crossing. Topological graphs G and H…
Perfect Matching-Cut is the problem of deciding whether a graph has a perfect matching that contains an edge-cut. We show that this problem is NP-complete for planar graphs with maximum degree four, for planar graphs with girth five, for…
It is well known that a graph is bipartite if and only if the spectrum of its adjacency matrix is symmetric. In the present paper, this assertion is dissected into three separate matrix results of wider scope, which are extended also to…
We say that a bipartite graph $G(A, B)$ with fixed parts $A$, $B$ is proximinal if there is a semimetric space $(X, d)$ such that $A$ and $B$ are disjoint proximinal subsets of $X$ and all edges $\{a, b\}$ satisfy the equality $d(a, b) =…
The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…
The complete transposition graph is defined to be the graph whose vertices are the elements of the symmetric group $S_n$, and two vertices $\alpha$ and $\beta$ are adjacent in this graph iff there is some transposition $(i,j)$ such that…
In this paper, we consider an equivalence relation within the class of finitely presented discrete groups attending to their asymptotic topology rather than their asymptotic geometry. More precisely, we say that two finitely presented…
We give a general construction leading to different non-isomorphic families $\Gamma_{n,q}(\K)$ of connected $q$-regular semisymmetric graphs of order $2q^{n+1}$ embedded in $\PG(n+1,q)$, for a prime power $q=p^h$, using the linear…
We consider a number of examples of groups together with an infinite conjugation invariant generating set, including: the free group with the generating set of all separable elements; surface groups with the generating set of all…
Unigraphs are graphs identifiable up to isomorphism from their degree sequences. Given a class $\mathcal{A}$ of graphs, we define the class of $\mathcal{A}$-unigraphs to be graphs identifiable from degree sequence and membership in…
Determining whether two graphs are structurally identical is a fundamental problem with applications spanning mathematics, computer science, chemistry, and network science. Despite decades of study, graph isomorphism remains a challenging…
A perfect matching in a hypergraph is a set of edges that partition the set of vertices. We study the complexity of deciding the existence of a perfect matching in orderable and separable hypergraphs. We show that the class of orderable…
We introduce the notion of a topological symmetry as a quantum mechanical symmetry involving a certain topological invariant. We obtain the underlying algebraic structure of the Z_2-graded uniform topological symmetries of type (1,1) and…
Hypergraph is a topological model for networks. In order to study the topology of hypergraphs, the homology of the associated simplicial complexes and the embedded homology have been invented. In this paper, we give some algorithms to…
We prove a topological rigidity result for simple, thick, hyperbolic P-manifolds of dimension 2: isomorphism of the fundamental groups implies homeomorphism of the P-manifolds. An immediate application is a diagram rigidity theorem for…
Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…
Random intersection graphs model networks with communities, assuming an underlying bipartite structure of groups and individuals, where these groups may overlap. Group memberships are generated through the bipartite configuration model.…
Intuitively speaking, a bipartite graph is mirror if it can be drawn in the Cartesian plane in such a way that, the vertices of one stable are points in x=0, the vertices of the other stable set are points in x=1, the edges are straight…