相关论文: Cut vertices in commutative graphs

We study quotients of mapping class groups of punctured spheres by suitable large powers of Dehn twists, showing an analogue of Ivanov's theorem for the automorphisms of the corresponding quotients of curve graphs. Then we use this result…

We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…

A decomposition of a graph is a set of subgraphs whose edges partition those of $G$. The 3-decomposition conjecture posed by Hoffmann-Ostenhof in 2011 states that every connected cubic graph can be decomposed into a spanning tree, a…

This work deals with relations between a bounded cohomological invariant and the geometry of Hermitian symmetric spaces of noncompact type. The invariant, obtained from the K\"ahler class, is used to define and characterize a special class…

We introduce a cohomology theory of grading-restricted vertex algebras. To construct the {\it correct} cohomologies, we consider linear maps from tensor powers of a grading-restricted vertex algebra to "rational functions valued in the…

The study of graph C*-algebras has a long history in operator algebras. Surprisingly, their quantum symmetries have never been computed so far. We close this gap by proving that the quantum automorphism group of a finite, directed graph…

In the standard category of directed graphs, graph morphisms map edges to edges. By allowing graph morphisms to map edges to finite paths (path homomorphisms of graphs), we obtain an ambient category in which we determine subcategories…

We study real nonsingular projective cubic fourfolds up to deformation equivalence combined with projective equivalence and prove that they are classified by the conjugacy classes of involutions induced by the complex conjugation in the…

A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…

Contact path geometries are curved geometric structures on a contact manifold comprising smooth families of paths modeled on the family of all isotropic lines in the projectivization of a symplectic vector space. Locally such a structure is…

We show that embedding calculus invariants $ev_n$ are surjective for long knots in an arbitrary $3$-manifold. This solves some remaining open cases of Goodwillie--Klein--Weiss connectivity estimates, and at the same time confirms one half…

Let $G$ be a finite group. Denoting by ${\rm{cd}}(G)$ the set of the degrees of the irreducible complex characters of $G$, we consider the {\it character degree graph} of $G$: this is the (simple, undirected) graph whose vertices are the…

Graphs are one of the most important data structures for representing pairwise relations between objects. Specifically, a graph embedded in a Euclidean space is essential to solving real problems, such as physical simulations. A crucial…

Homomorphism indistinguishability is a way of characterising many natural equivalence relations on graphs. Two graphs $G$ and $H$ are called homomorphism indistinguishable over a graph class $\mathcal{F}$ if for each $F \in \mathcal{F}$,…

We discuss a graph complex formed by directed acyclic graphs with external legs. This complex comes in particular with a map to the ribbon graph complex computing the (compactly supported) cohomology of the moduli space of points $\mathcal…

After introducing a noncommutative counterpart of commutative algebraic geometry based on monoidal categories of quasi-coherent sheaves we show that various constructions in noncommutative geometry (e.g. Morita equivalences, Hopf-Galois…

Suppose a finite, unweighted, combinatorial graph $G = (V,E)$ is the union of several (degree-)regular graphs which are then additionally connected with a few additional edges. $G$ will then have only a small number of vertices $v \in V$…

This paper is the first from a series of papers that provide a characterization of maximum packings of $T$-cuts in bipartite graphs. Given a connected graph, a set $T$ of an even number of vertices, and a minimum $T$-join, an edge weighting…

A graph is an instrument which is extensively utilized to model various problems in different fields. Up to date, many graphs have been developed to represent algebraic structures, particularly rings in order to study their properties. In…

Curvature is a fundamental geometric characteristic of smooth spaces. In recent years different notions of curvature have been developed for combinatorial discrete objects such as graphs. However, the connections between such discrete…