Related papers: Path-cordial abelian groups

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…

A class A of labelled graphs is bridge-addable if for all graphs G in A and all vertices u and v in distinct connected components of G, the graph obtained by adding an edge between u and u is also in A; the class A is monotone if for all G…

We prove that Matui's AH conjecture holds for graph groupoids of infinite graphs. This is a conjecture which relates the topological full group of an ample groupoid with the homology of the groupoid. Our main result complements Matui's…

Garoufalidis and Levine introduced the homology cobordism group of homology cylinders over a surface. This group can be regarded as a generalization of the mapping class group. Using torsion invariants, we show that the abelianization of…

A class $\mathcal{G}$ of graphs is called hereditary if it is closed under taking induced subgraphs. We denote by $G^{epex}$ the class of graphs that are at most one edge away from being in $\mathcal{G}$. We note that $G^{epex}$ is…

The lattice of fully invariant subgroups of an abelian $p$--group and the lattice of ideals of its endomorphism ring are classified by systems of cardinal invariants.

Perfect graphs form one of the distinguished classes of finite simple graphs. In 2006, Chudnovsky, Robertson, Seymour and Thomas proved that a graph is perfect if and only if it has no odd holes and no odd antiholes as induced subgraphs,…

We show that if $G$ is a non-elementary word hyperbolic group, mapping class group of a hyperbolic surface or the outer automorphism group of a nonabelian free group then $G$ has $2^{\aleph_0}$ many continuous ergodic invariant random…

The edges of any hypergraph parametrize a monomial algebra called the edge subring of the hypergraph. We study presentation ideals of these edge subrings, and describe their generators in terms of balanced walks on hypergraphs. Our results…

To a family of smooth projective cubic surfaces one can canonically associate a family of abelian fivefolds. In characteristic zero, we calculate the Hodge groups of the abelian varieties which arise in this way. In arbitrary characteristic…

Given a graph $G$ with $n$ vertices and an Abelian group $A$ of order $n$, an $A$-distance antimagic labelling of $G$ is a bijection from $V(G)$ to $A$ such that the vertices of $G$ have pairwise distinct weights, where the weight of a…

An undirected graph is said to be cordial if there is a friendly (0,1)-labeling of the vertices that induces a friendly (0,1)-labeling of the edges. An undirected graph $G$ is said to be $(2,3)$-orientable if there exists a friendly…

We prove a conjecture due to Baumgaertel and Lledo according to which for every compact group G one has Z(G)^ \cong C(G), where the `chain group' C(G) is the free abelian group (written multiplicatively) generated by the set G^ of…

We initiate the study of the $p$-local commensurability graph of a group, where $p$ is a prime. This graph has vertices consisting of all finite-index subgroups of a group, where an edge is drawn between $A$ and $B$ if $[A : A\cap B]$ and…

We study "positive" graphs that have a nonnegative homomorphism number into every edge-weighted graph (where the edgeweights may be negative). We conjecture that all positive graphs can be obtained by taking two copies of an arbitrary…

A path decomposition of a graph $G$ is a collection of edge-disjoint paths of $G$ that covers the edge set of $G$. Gallai (1968) conjectured that every connected graph on $n$ vertices admits a path decomposition of cardinality at most…

Arboreal networks are a generalization of rooted trees, defined by keeping the tree-like structure, but dropping the requirement for a single root. Just as the class of cographs is precisely the class of undirected graphs that can be…

We characterize the groups isomorphic to full automorphism groups of ordered abelian groups. The result will follow from classical theorems on ordered groups adding an argument from proofs used to realize rings as endomorphism rings of…

The $H$-join of a family of graphs $\mathcal{G}=\{G_1, \dots, G_p\}$, also called the generalized composition, $H[G_1, \dots, G_p]$, where all graphs are undirected, simple and finite, is the graph obtained by replacing each vertex $i$ of…

Let $G=(V,E)$ be a finite, simple graph. We consider for each oriented graph $G_{\cal O}$ associated to an orientation ${\cal O}$ of the edges of $G$, the toric ideal $P_{G_{\cal O}}$. In this paper we study those graphs with the property…