English
Related papers

Related papers: On the graph condition regarding the $F$-inverse c…

200 papers

We study the geometry of algebraic monoids. We prove that the group of invertible elements of an irreducible algebraic monoid is an algebraic group, open in the monoid. Moreover, if this group is reductive, then the monoid is affine. We…

Algebraic Geometry · Mathematics 2007-05-23 A. Rittatore

This note presents a new, elementary proof of a generalization of a theorem of Halin to graphs with unbounded degrees, which is then applied to show that every connected, countably infinite graph G with a subdegree-finite, infinite…

Combinatorics · Mathematics 2015-11-16 Wilfried Imrich , Simon M. Smith

For a given graph $G$, the least integer $k\geq 2$ such that for every Abelian group $\mathcal{G}$ of order $k$ there exists a proper edge labeling $f:E(G)\rightarrow \mathcal{G}$ so that $\sum_{x\in N(u)}f(xu)\neq \sum_{x\in N(v)}f(xv)$…

Combinatorics · Mathematics 2023-06-22 Sylwia Cichacz , Jakub Przybyło

We prove that any class of graphs with linear neighborhood complexity has bounded improper odd chromatic number. As a result, if $\mathcal{G}$ is the class of all circle graphs, or if $\mathcal{G}$ is any class with bounded twin-width,…

Combinatorics · Mathematics 2026-02-12 James Davies , Meike Hatzel , Kolja Knauer , Rose McCarty , Torsten Ueckerdt

A copy of a graph $F$ is called an $F$-copy. For any graph $G$, the $F$-isolation number of $G$, denoted by $\iota(G,F)$, is the size of a smallest subset $D$ of the vertex set of $G$ such that the closed neighbourhood $N[D]$ of $D$ in $G$…

Combinatorics · Mathematics 2025-08-21 Peter Borg

We prove a substantial extension of an inverse spectral theorem of Ambarzumyan, and show that it can be applied to arbitrary compact Riemannian manifolds, compact quantum graphs and finite combinatorial graphs, subject to the imposition of…

Spectral Theory · Mathematics 2010-10-04 E. B. Davies

We consider topological conditions under which a locally invertible map admits a global inverse. Our main theorem states that a local diffeomorphism $f: M \to\mathbb{R}^n$ is bijective if and only if $H_{n-1}(M)=0$ and the pre-image of…

Geometric Topology · Mathematics 2008-08-04 Eduardo Cabral Balreira

We show that for any natural number $s$, there is a constant $\gamma$ and a subgraph-closed class having, for any natural $n$, at most $\gamma^n$ graphs on $n$ vertices up to isomorphism, but no adjacency labeling scheme with labels of size…

Combinatorics · Mathematics 2026-02-10 Édouard Bonnet , Julien Duron , John Sylvester , Viktor Zamaraev , Maksim Zhukovskii

Twin-width is a recently introduced graph parameter with applications in algorithmics, combinatorics, and finite model theory. For graphs of bounded degree, finiteness of twin-width is preserved by quasi-isometry. Thus, through Cayley…

Group Theory · Mathematics 2022-07-18 Édouard Bonnet , Colin Geniet , Romain Tessera , Stéphan Thomassé

The paper is partially withdrawn: in its current form, Lemma 2.3 is false, so that our proof of Theorem A and Proposition B has an important gap. We were unable to fix it yet. Any help is most welcome. We prove that the restriction of…

Geometric Topology · Mathematics 2019-01-08 Sebastian Baader , Pierre Dehornoy

For a set of five edges, a graph splits if one of the associated Dodgson polynomials is equal to zero. A graph G splitting for every set of five edges is a minor-closed property. As such there is a finite set of forbidden minors F such that…

Combinatorics · Mathematics 2013-12-09 Iain Crump

Let $G$ be a group and $S$ an inverse closed subset of $G\setminus \{1\}$. By a Cayley graph $Cay(G,S)$ we mean the graph whose vertex set is the set of elements of $G$ and two vertices $x$ and $y$ are adjacent if $x^{-1}y\in S$. A group…

Group Theory · Mathematics 2017-10-13 A. Abdollahi , M. Zallaghi

Given a rational homology sphere M, whose splice diagram satisfy the semigroup condition, Neumann and Wahl were able to define a complete intersection surface singularity called splice diagram singularity from the splice diagram of M. They…

Geometric Topology · Mathematics 2010-11-04 Helge Møller Pedersen

A countably infinite Boolean inverse monoid that can be written as an increasing union of finite Boolean inverse monoids (suitably embedded) is said to be of finite type. Borrowing terminology from $C^{\ast}$-algebra theory, we say that…

Category Theory · Mathematics 2025-05-22 Mark V. Lawson , Philip Scott

We determine the structure of automorphism groups of finite graphs of bounded Hadwiger number. Our proof includes a structural analysis of finite edge-transitive graphs. In particular, we show that for connected, $K_{h+1}$-minor-free,…

Combinatorics · Mathematics 2025-09-24 Martin Grohe , Pascal Schweitzer , Daniel Wiebking

We define two categories, the category $\mathfrak{F}\mathfrak{G}$ of fuzzy subgroups, and the category $\mathfrak{F}\mathfrak{C}$ of $F$-inverse covers of inverse monoids, and prove that $\mathfrak{F}\mathfrak{G}$ fully embeds into…

General Mathematics · Mathematics 2020-11-16 Elton Pasku

Given graphs H_1,...,H_k, we study the minimum order of a graph G such that for each i, the induced copies of H_i in G cover V(G). We prove a general upper bound of twice the sum of the numbers m_i, where m_i is one less than the order of…

Combinatorics · Mathematics 2007-05-23 Zoltan Furedi , Dhruv Mubayi , Douglas B. West

This paper verifies Abhyankar's Inertia Conjecture for certain sporadic groups $G$ in particular characteristics by showing that all possible inertia groups occur for $G$-Galois covers of the affine line. For a larger set of sporadic…

Number Theory · Mathematics 2020-10-16 Dean Bisogno

Every infinite group $G$ of regular cardinality can be partitioned $G=A_1\cup A_2$ so that $G\neq FA_1$, $G\neq FA_2$ for every subset $F\subset G$ of cardinality $|F|<|G|$. The first author asked whether the same is true for each group $G$…

Group Theory · Mathematics 2014-08-26 Igor Protasov , Sergii Slobodianiuk

In this paper we show that polycyclic monoids are universal objects in the class of graph inverse semigroups. In particular, we prove that a graph inverse semigroup $G(E)$ over a directed graph $E$ embeds into the polycyclic monoid…

General Topology · Mathematics 2018-10-11 Serhii Bardyla