Related papers: Borel Vizing's Theorem for 2-Ended Groups

In this paper, we study the concept of edge-group choosability of graphs. We say that G is edge k-group choosable if its line graph is k-group choosable. An edge-group choosability version of Vizing conjecture is given. The evidence of our…

We give a non-abelian analogue of Whitney's 2-isomorphism theorem for graphs. Whitney's theorem states that the cycle space determines a graph up to 2-isomorphism. Instead of considering the cycle space of a graph which is an abelian…

Let $\mathbf G$ be a graphing, that is a Borel graph defined by $d$ measure preserving involutions. We prove that if $\mathbf G$ is {\em treeable} then it arises as the local limit of some sequence $(G_n)_{n\in\mathbb{N}}$ of graphs with…

We prove a Morse index theorem for action functionals on paths that are allowed to reflect at a hypersurface (either in the interior or at the boundary of a manifold). Both fixed and periodic boundary conditions are treated.

We study genus 2 covers of relative elliptic curves over an arbitrary base in which 2 is invertible. Particular emphasis lies on the case that the covering degree is 2. We show that the data in the "basic construction" of genus 2 covers of…

This note outlines the Borel-Weil-Bott theory for (arbitrary-genus) flag varieties of loop groups, following ideas of G. Segal. Recent revivalist interest in the "WZW fusion rules" suggests that my original (CMP 1995) treatment of the…

This is an extended version of my earlier articel "Projective and injective objects in symmetric categorical groups. arXiv:1007.0121v1." Several new facts added, including the material on the derived 2-functors and the proof of the…

A framework to handle tree decompositions of the components of a Borel graph in a Borel fashion is introduced, along the lines of Tserunyan's Stallings Theorem for equivalence relations arXiv:1805.09506. This setting leads to a notion of…

We prove that every 2k-edge-connected graph with countably many edge-ends admits a k-arc-connected orientation, extending the previous result by Assem, Koloschin and Pitz that also assumed the hypothesis of the graph being locally finite.…

We describe a way of assigning labels to the vertices of any undirected graph on up to $n$ vertices, each composed of $n/2+O(1)$ bits, such that given the labels of two vertices, and no other information regarding the graph, it is possible…

We introduce a divisibility-type condition for directed graphs that is necessary for $\mathcal{Z}$-stability of the corresponding graph $C^*$-algebra. We prove that this condition is sufficient if either the graph $E$ has no cycles or the…

We show that if a graph is k-edge-connected, and we adjoin to it another graph satisfying a "contracted diameter less or equal to 2" condition, with minimal degree greater or equal to k, and some natural hypothesis on the edges connecting…

Recently, several works by a number of authors have studied integrality, distance integrality, and distance powers of Cayley graphs over some finite groups, such as dicyclic groups and (generalized) dihedral groups. Our aim is to generalize…

The cohomology of coherent sheaves and sheaves of Abelian groups on Noetherian schemes are interpreted in second order arithmetic by means of a finiteness theorem. This finiteness theorem provably fails for the etale topology even on…

A classical theorem of Scheunert on $G$-color Lie algebras, asserts in the case of finitely generated abelian groups, one can twist the algebra structure and the commutation bicharacter on $G$ by a 2-cocycle twist to a super-Lie $G$ graded,…

We answer a question on group connectivity suggested by Jaeger et al. [Group connectivity of graphs -- A nonhomogeneous analogue of nowhere-zero flow properties, JCTB 1992]: we find that $\mathbb Z_2^2$-connectivity does not imply $\mathbb…

In this paper, we apply techniques from equivariant geometry to prove that a generalized Bour's theorem holds for surfaces that are invariant under the action of a one-parameter group of isometries of a three-dimensional Riemannian…

Courcelle's Theorem is an important result in graph theory, proving the existence of linear-time algorithms for many decision problems on graphs whose tree-width is bounded by a constant. The purpose of this text is twofold: to provide an…

Elmendorf's Theorem states that the category of continuous actions of a topological group is a Grothendieck topos in the sense that it is equivalent to a category of sheaves on a site. This paper offers a 2-dimensional generalization by…

Fix a palette $\mathcal K$ of $\Delta+1$ colours, a graph with maximum degree $\Delta$, and a subset $M$ of the edge set with minimum distance between edges at least $9$. If the edges of $M$ are arbitrarily precoloured from $\mathcal K$,…