English
Related papers

Related papers: When does an infinite ring have a finite compresse…

200 papers

Over all graphs (or unicyclic graphs) of a given order, we characterise those graphs that minimise or maximise the number of connected induced subgraphs. For each of these classes, we find that the graphs that minimise the number of…

Combinatorics · Mathematics 2019-09-18 Audace A. V. Dossou-Olory

Let $R$ be a ring with unity. The graph $\Gamma(R)$ is a graph with vertices as elements of $R$, where two distinct vertices $a$ and $b$ are adjacent if and only if $Ra+Rb=R$. Let $\Gamma_2(R)$ is the subgraph of $\Gamma(R)$ induced by the…

Rings and Algebras · Mathematics 2010-07-21 S. Akbari , M. Habibi , A. Majidinya , R. Manaviyat

In this paper, we investigate the existence of quantum fractional revival in unitary Cayley graphs over finite commutative rings with identity. We characterize all finite local rings that permit quantum fractional revival in their unitary…

Rings and Algebras · Mathematics 2026-01-15 Saowalak Jitngam , Poom Kumam , Songpon Sriwongsa

The fundamental quandle is a complete invariant for unoriented tame knots \cite{JO, Ma} and non-split links \cite{FR}. The proof involves proving a relationship between the components of the fundamental quandle and the cosets of the…

Geometric Topology · Mathematics 2026-02-26 Blake Mellor

Let R be an Artinian ring and G be the compressed zero-divisor graph associated to R. The question of when the clique number of compressed zero-divisor graphs is finite was raised by J. Coykendall, S. Sather-Wagstaff, L. Sheppardson, and S.…

Combinatorics · Mathematics 2020-10-15 Ganesh S. Kadu

In this paper we introduce the concept of purely infinite rings, which in the simple case agrees with the already existing notion of pure infiniteness. We establish various permanence properties of this notion, with respect to passage to…

Rings and Algebras · Mathematics 2008-06-26 Gonzalo Aranda Pino , Ken Goodearl , Francesc Perera , Mercedes Siles Molina

Given a countable graph, we say a set $A$ of its vertices is \emph{universal} if it contains every countable graph as an induced subgraph, and $A$ is \emph{weakly universal} if it contains every finite graph as an induced subgraph. We show…

Combinatorics · Mathematics 2017-02-24 Will Brian

The commuting graph of a finite soluble group with trivial centre is investigated. It is shown that the diameter of such a graph is at most 8 or the graph is disconnected. Examples of soluble groups with trivial centre and commuting graph…

Group Theory · Mathematics 2014-02-26 Chris Parker

In finite graphs, finite-order tangles offer an abstract description of highly connected substructures. In infinite graphs, infinite-order tangles compactify the graphs in the same way the ends compactify connected locally finite graphs.…

Combinatorics · Mathematics 2019-08-28 Jan Kurkofka

We apply model theoretic methods to the problem of existence of countable universal graphs with finitely many forbidden connected subgraphs. We show that to a large extent the question reduces to one of local finiteness of an…

Logic · Mathematics 2016-09-07 Gregory Cherlin , Saharon Shelah , Niandong Shi

We show that there are four infinite prime graphs such that every infinite prime graph with no infinite clique embeds one of these graphs. We derive a similar result for infinite prime posets with no infinite chain or no infinite antichain.

Combinatorics · Mathematics 2008-12-09 Maurice Pouzet , Imed Zaguia

Let $R$ be a ring with unity. The cozero-divisor graph of a ring $R$ is an undirected simple graph whose vertices are the set of all non-zero and non-unit elements of $R$ and two distinct vertices $x$ and $y$ are adjacent if and only if $x…

Combinatorics · Mathematics 2023-01-31 Praveen Mathil , Barkha Baloda , Jitender Kumar

The commuting graph of a semigroup is the set of non-central elements; the edges are defined as pairs $(u,v)$ satisfying $uv=vu$. We provide an example of a field $F$ and an integer $n$ such that the commuting graph of…

Combinatorics · Mathematics 2016-03-11 Yaroslav Shitov

Halin proved that every graph with an end $\omega$ containing infinitely many pairwise disjoint rays admits a subdivision of the infinite quarter-grid as a subgraph where all rays from that subgraph belong to $\omega$. We will prove a…

Combinatorics · Mathematics 2026-02-27 Matthias Hamann , Karl Heuer

In this article, we introduce a new graph theoretic structure associated with a finite commutative ring, called nil clean divisor graph. For a ring $R$, nil clean divisor graph is denoted by $G_N(R)$, where the vertex set is $\{x\in R\,:\,…

Rings and Algebras · Mathematics 2019-03-07 Ajay Sharma , Dhiren Kumar Basnet

We introduce and study asymptotically rigid mapping class groups of certain infinite graphs. We determine their finiteness properties and show that these depend on the number of ends of the underlying graph. In a special case where the…

Geometric Topology · Mathematics 2025-09-01 Thomas Hill , Sanghoon Kwak , Brian Udall , Jeremy West

The annihilator graph $AG(R)$ of the commutative ring $R$ is an undirected graph with vertex set as the set of all non-zero zero divisors of $R$, and two distinct vertices $x$ and $y$ are adjacent if and only if $ann(xy) \neq ann(x) \cup…

Combinatorics · Mathematics 2024-10-15 Mohd Shariq , Praveen Mathil , Mohd Nazim , Jitender Kumar

We classify all non-degenerate skew-hermitian forms defined over certain local rings, not necessarily commutative, and study some of the fundamental properties of the associated unitary groups, including their orders when the ring in…

Rings and Algebras · Mathematics 2018-04-10 J. Cruickshank , F. Szechtman

We will determine all infinite $2$-locally finite groups as well as infinite $2$-groups with planar subgroup graph and show that infinite groups satisfying the chain conditions containing an involution do not have planar embeddings. Also,…

Group Theory · Mathematics 2014-03-04 Mehdi Rajabian , Mohammad Farrokhi Derakhshandeh Ghouchan , Ahmad Erfanian

We say that a graph is intrinsically non-trivial if every spatial embedding of the graph contains a non-trivial spatial subgraph. We prove that an intrinsically non-trivial graph is intrinsically linked, namely every spatial embedding of…

Geometric Topology · Mathematics 2016-01-20 Ryo Nikkuni
‹ Prev 1 3 4 5 6 7 10 Next ›