On connected subgraph arrangements

Abstract

Recently, Cuntz and Kühne introduced a particular class of hyperplane arrangements stemming from a given graph G, so called connected subgraph arrangements AG. In this note we strengthen some of the result from their work and prove new ones for members of this class. For instance, we show that aspherical members withing this class stem from a rather restricted set of graphs. Specifically, if AG is an aspherical connected subgraph arrangement, then AG is free with the unique possible exception when the underlying graph G is the complete graph on 4 nodes.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…