Related papers: Unstable Graphs: A Fresh Outlook via TF-Automorphi…
We study graphs which admit an acyclic orientation that contains an out-branching and in-branching which are arc-disjoint (such an orientation is called {\bf good}). A {\bf 2T-graph} is a graph whose edge set can be decomposed into two…
It is known that the canonical double cover of any connected nonbipartite graph have an automorphism group of the form $H \rtimes \mathbb{Z}_2$, where $H$ is the set of automorphism which preserve bipartite parts. We construct connected…
Chudnovsky, Kim, Oum, and Seymour recently established that any prime graph contains one of a short list of induced prime subgraphs [1]. In the present paper we reprove their theorem using many of the same ideas, but with the key…
For $\alpha \in (1,2]$, the $\alpha$-stable graph arises as the universal scaling limit of critical random graphs with i.i.d. degrees having a given $\alpha$-dependent power-law tail behavior. It consists of a sequence of compact measured…
The definition of edge-regularity in graphs is a relaxation of the definition of strong regularity, so strongly regular graphs are edge-regular and, not surprisingly, the family of edge-regular graphs is much larger and more diverse than…
A conditional independence graph is a concise representation of pairwise conditional independence among many variables. Graphical Random Forests (GRaFo) are a novel method for estimating pairwise conditional independence relationships among…
We construct infinite families of topologically isotopic but smoothly distinct knotted spheres in many simply connected 4-manifolds that become smoothly isotopic after stabilizing by connected summing with $S^2 \times S^2$, and as a…
The stability number of a graph G, denoted by alpha(G), is the cardinality of a maximum stable set, and mu(G) is the cardinality of a maximum matching in G. If alpha(G)+mu(G) equals its order, then G is a Konig-Egervary graph. In this paper…
As the representations output by Graph Neural Networks (GNNs) are increasingly employed in real-world applications, it becomes important to ensure that these representations are fair and stable. In this work, we establish a key connection…
We present a new sufficient condition on stability number and toughness of the graph to have an f-factor.
A graph is alpha-critical if its stability number increases whenever an edge is removed from its edge set. The class of alpha-critical graphs has several nice structural properties, most of them related to their defect which is the number…
An isotopy between two diffeomorphisms means the existence of an arc connecting them in the space of diffeomorphisms. Among such arcs there are so-called stable arcs, which do not qualitatively change under small perturbations. In the…
The graph reconstruction conjecture states that all graphs on at least three vertices are determined up to isomorphism by their deck. In this paper, a general framework for this problem is proposed to simply explain the reconstruction of…
A tuple (s1,t1,s2,t2) of vertices in a simple undirected graph is 2-linked when there are two vertex-disjoint paths respectively from s1 to t1 and s2 to t2. A graph is 2-linked when all such tuples are 2-linked. We give a new and simple…
Let $G$ be a group. The directed endomorphism graph, $\dend(G)$ of $G$ is a directed graph with vertex set $G$ and there is a directed edge from the vertex $a$ to the vertex $b$ if $a \neq b$ and there exists an endomorphism on $G$ mapping…
Let $G$ be a group. The directed endomorphism graph, \dend of $G$ is a directed graph with vertex set $G$ and there is a directed edge from the vertex `$a$' to the vertex `$\, b$' $(a \neq b) $ if and only if there exists an endomorphism on…
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…
Let M be an open, connected manifold. A classical theorem of McDuff and Segal states that the sequence of configuration spaces of n unordered, distinct points in M is homologically stable with coefficients in Z: in each degree, the integral…
The linear stability of stratified two-phase flows in rectangular ducts is studied numerically. The linear stability analysis takes into account all possible infinitesimal three-dimensional disturbances and is carried out by solution of the…
We relate the graph isomorphism problem to the solvability of certain systems of linear equations with nonnegative variables. This version replaces the two previous versions of this paper.