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

For an oriented graph $D$, the inversion of $X\subseteq V(D)$ in $D$ is the graph obtained by reversing the orientation of all arcs with both ends in $X$. The inversion number $\mathrm{inv}(D)$ is the minimum number of inversions needed to…

We define the cover number of a graph $G$ by a graph class $\mathcal P$ as the minimum number of graphs of class $\mathcal P$ required to cover the edge set of $G$. Taking inspiration from a paper by Harary, Hsu and Miller, we find an exact…

Motivated by Hadwiger's conjecture, Seymour asked which graphs $H$ have the property that every non-null graph $G$ with no $H$ minor has a vertex of degree at most $|V(H)|-2$. We show that for every monotone graph family $\mathcal{F}$ with…

In the List $k$-Coloring problem we are given a graph whose every vertex is equipped with a list, which is a subset of $\{1,\ldots,k\}$. We need to decide if $G$ admits a proper coloring, where every vertex receives a color from its list.…

Our main result is a sharp bound for the number of vertices in a minimal forbidden subgraph for the graphs having minimum rank at most 3 over the finite field of order 2. We also list all 62 such minimal forbidden subgraphs. We conclude by…

In 2018, Legrand and Paran proved a weaker form of the Inverse Galois Problem for all Hilbertian fields and all finite groups: that is, there exist possibly non-Galois extensions over given Hilbertian base field with given finite group as…

The index of a subgroup of a group counts the number of cosets of that subgroup. A subgroup of finite index often shares structural properties with the group, and the existence of a subgroup of finite index with some particular property can…

Graph products of monoids provide a common framework for free products and direct products. Trace monoids are graph products of finitely generated free monoids. We investigate the interaction of certain finitary conditions with graph…

We investigate the question how `small' a graph can be, if it contains all members of a given class of locally finite graphs as subgraphs or induced subgraphs. More precisely, we give necessary and sufficient conditions for the existence of…

In an earlier work, finite groups whose power graphs are minimally edge connected have been classified. In this article, first we obtain a necessary and sufficient condition for an arbitrary graph to be minimally edge connected.…

It has been conjectured that if a finite graph has a vertex coloring such that the union of any two color classes induces a connected graph, then for every set $T$ of vertices containing exactly one member from each color class there exists…

As part of the graph minor project, Robertson and Seymour showed in 1990 that the class of graphs that can be embedded in a given surface can be characterized by a finite set of minimal excluded minors. However, their proof, because…

We introduce and study a strong "thin triangle"' condition for directed graphs, which generalises the usual notion of hyperbolicity for a metric space. We prove that finitely generated left cancellative monoids whose right Cayley graphs…

Let $G$ be an undirected graph on $n$ vertices and let $S(G)$ be the set of all $n \times n$ real symmetric matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of $G$. The inverse eigenvalue…

Given a set $\mathcal{F}$ of finite groups, it is said that a group $G$ is an $\mathcal{F}$-cover if every group in $\mathcal{F}$ is isomorphic to a subgroup of $G$. Moreover, $G$ is a minimum $\mathcal{F}$-cover if there is no…

Given an infinite graph $G$ on countably many vertices, and a closed, infinite set $\Lambda$ of real numbers, we prove the existence of an unbounded self-adjoint operator whose graph is $G$ and whose spectrum is $\Lambda$.

We give an example of a monoid with finitely many left and right ideals, all of whose Schutzenberger groups are presentable by finite complete rewriting systems, and so each have finite derivation type, but such that the monoid itself does…

We define a covering of a profinite graph to be a projective limit of a system of covering maps of finite graphs. With this notion of covering, we develop a covering theory for profinite graphs which is in many ways analogous to the…

In this short note we answer a query of Brodzki, Niblo, \v{S}pakula, Willett and Wright by showing that all bounded degree uniformly locally amenable graphs have Property A. For the second result of the note recall that Kaiser proved that…

Let $\mathcal{G}$ be a minor-closed graph class. We say that a graph $G$ is a $k$-apex of $\mathcal{G}$ if $G$ contains a set $S$ of at most $k$ vertices such that $G\setminus S$ belongs to $\mathcal{G}.$ We denote by $\mathcal{A}_k…