English
Related papers

Related papers: Graph 4-braid groups and Massey products

200 papers

Grohe and Marx proved that if G does not contain H as a topological minor, then there exist constants g=O(|V(H)|^4), D and t depending only on H such that G is a clique sum of graphs that either contain at most t vertices of degree greater…

Combinatorics · Mathematics 2012-09-04 Zdenek Dvorak

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,…

Commutative Algebra · Mathematics 2023-07-14 Hidefumi Ohsugi , Kazuki Shibata , Akiyoshi Tsuchiya

Watanabe's theta graph diffeomorphism, constructed using Watanabe's clasper surgery construction which turns trivalent graphs in 4-manifolds into parameterized families of diffeomorphisms of 4-manifolds, is a diffeomorphism of $S^4$…

Geometric Topology · Mathematics 2025-11-26 David T. Gay

We discuss various types of Tits Alternative for subgroups of graph products of groups, and prove that, under some natural conditions, a graph product of groups satisfies a given form of Tits Alternative if and only if each vertex group…

Group Theory · Mathematics 2016-08-12 Yago Antolín , Ashot Minasyan

We study geometric presentations of braid groups for particles that are constrained to move on a graph, i.e. a network consisting of nodes and edges. Our proposed set of generators consists of exchanges of pairs of particles on junctions of…

Mathematical Physics · Physics 2021-05-12 Byung Hee An , Tomasz Maciazek

We introduce a topological invariant, it a type of a graph-manifold, which takes natural values. For a 4-dimensional graph-manifold, whose type does not exceed two, it is proved that its universal cover is bi-Lipschitz equivalent to a…

Geometric Topology · Mathematics 2017-11-27 Aleksandr Smirnov

Given a 3-connected biased graph $\Omega$ with a balancing vertex, and with frame matroid $F(\Omega)$ nongraphic and 3-connected, we determine all biased graphs $\Omega'$ with $F(\Omega') = F(\Omega)$. As a consequence, we show that if $M$…

Combinatorics · Mathematics 2017-11-17 Matt DeVos , Daryl Funk

We prove that if $D$ is a digraph of maximum outdegree and indegree at least $k$, and minimum semidegree at least $k/2$ that contains no oriented $4$-cycles, then $D$ contains each oriented tree $T$ with~$k$ arcs. This can be slightly…

Combinatorics · Mathematics 2024-11-21 Maya Stein , Ana Trujillo-Negrete

Undirected co-graphs are those graphs which can be generated from the single vertex graph by disjoint union and join operations. Co-graphs are exactly the P_4-free graphs (where P_4 denotes the path on 4 vertices). Co-graphs itself and…

Discrete Mathematics · Computer Science 2020-10-23 Frank Gurski , Dominique Komander , Carolin Rehs

Let $q$ be a prime power such that $q\equiv 1\pmod{4}$. The Paley graph of order $q$ is the graph with vertex set as the finite field $\mathbb{F}_q$ and edges defined as, $ab$ is an edge if and only if $a-b$ is a non-zero square in…

Combinatorics · Mathematics 2021-10-08 Anwita Bhowmik , Rupam Barman

Charts are oriented labeled graphs in a disk. Any simple surface braid (2-dimensonal braid) can be described by using a chart. Also, a chart represents an oriented closed surface embedded in 4-space. In this paper, we investigate embedded…

Geometric Topology · Mathematics 2022-07-26 Teruo Nagase , Akiko Shima

We define and study extensions of Artin's representation and braid monodromy representation to the case of topological and algebraical generalisations of braid groups. In particular we provide faithful representations of braid groups of…

Group Theory · Mathematics 2007-05-23 Valerij G. Bardakov , Paolo Bellingeri

A finite simple graph $\Gamma$ determines a quotient $P_\Gamma$ of the pure braid group, called a graphic arrangement group. We analyze homomorphisms of these groups defined by deletion of sets of vertices, using methods developed in prior…

Geometric Topology · Mathematics 2021-09-10 Daniel C Cohen , Michael J Falk

As a major step in their proof of Wagner's conjecture, Robertson and Seymour showed that every graph not containing a fixed graph $H$ as a minor has a tree-decomposition in which each torso is almost embeddable in a surface of bounded…

Combinatorics · Mathematics 2018-07-04 Joshua Erde , Daniel Weißauer

We are concerned with orderable groups and particularly those with orderings invariant not only under multiplication, but also under a given automorphism or family of automorphisms. Several applications to topology are given: we prove that…

Group Theory · Mathematics 2014-10-01 Dale Rolfsen , Bert Wiest

We prove that every $n$-vertex complete simple topological graph generates at least $\Omega(n)$ pairwise disjoint $4$-faces. This improves upon a recent result by Hubard and Suk. As an immediate corollary, every $n$-vertex complete simple…

Combinatorics · Mathematics 2024-11-26 Ji Zeng

We study the structure of graphs that do not contain the wheel on 5 vertices W4 as an immersion, and show that these graphs can be constructed via 1, 2, and 3-edge-sums from subcubic graphs and graphs of bounded treewidth.

Combinatorics · Mathematics 2016-02-08 Rémy Belmonte , Archontia Giannopoulou , Daniel Lokshtanov , Dimitrios M. Thilikos

We classify closed, topological spin$^+$ 4-manifolds with fundamental group $\pi$ of cohomological dimension $\leq 3$ (up to s-cobordism), after stabilization by connected sum with at most $b_3(\pi)$ copies of $S^2\times S^2$. In general we…

Geometric Topology · Mathematics 2019-08-16 Ian Hambleton , Alyson Hildum

In this paper we prove that the Morse boundary of a free product depends only on the Morse boundary of its factors. In fact, we also prove the analogous result for graphs of groups with finite edge groups and infinitely many ends. This is a…

Group Theory · Mathematics 2023-07-06 Stefanie Zbinden

Let ${\rm ex \,} {\mathcal B}$ be a minor-closed class of graphs with a set ${\mathcal B}$ of minimal excluded minors. We study (a) the asymptotic number of graphs without $k+1$ disjoint minors in ${\mathcal B}$ and (b) the properties of a…

Combinatorics · Mathematics 2019-07-16 Valentas Kurauskas