English
Related papers

Related papers: On connected subgraph arrangements

200 papers

We study the free path problem, i.e., if we are given two free arrangements of hyperplanes, then we can connect them by free arrangements or not. We prove that if an arrangement $\mathcal{A}$ and $\mathcal{A} \setminus \{H,L\}$ are free,…

Combinatorics · Mathematics 2023-06-21 Takuro Abe , Toru Yamaguchi

In this paper, the association scheme defined on the flags of a finite generalized quadrangle is considered. All possible fusions of this scheme are listed, and a full description for those of classes 2 and 3 is given. Furthermore, it is…

Combinatorics · Mathematics 2024-06-07 Francesco Colangelo , Giusy Monzillo , Alessandro Siciliano

We study the structure algebra $\mathcal{Z}$ of the stable moment graph for the case of the affine root system $A_{1}$. The structure algebra $\mathcal{Z}$ is an algebra over a symmetric algebra and in particular, it is a module over a…

Representation Theory · Mathematics 2019-09-18 Ksenija Kitanov

We first prove that for every vertex x of a 4-connected graph G there exists a subgraph H in G isomorphic to a subdivision of the complete graph K4 on four vertices such that G-V(H) is connected and contains x. This implies an affirmative…

Combinatorics · Mathematics 2011-01-28 Matthias Kriesell

The problem of inner vs outer conjugacy of subalgebras of certain graph C*-algebras is investigated. For a large class of finite graphs E, we show that whenever $\alpha$ is a vertex-fixing quasi-free automorphism of the corresponding graph…

Operator Algebras · Mathematics 2022-09-09 Tomohiro Hayashi , Jeong Hee Hong , Sophie Emma Zegers , Wojciech Szymański

The existence of Hamiltonian cycles in 1-planar graphs with higher connectivity has attracted considerable attention. Recently, the authors and Dong proved that 4-connected 1-planar chordal graphs are Hamiltonian-connected. In this paper,…

Combinatorics · Mathematics 2024-11-05 Licheng Zhang , Shengxiang Lv , Yuanqiu Huang

Let $G$ be a finite group and let $N$ be a normal subgroup of $G$. We attach to $N$ two graphs ${\Gamma}_G(N)$ and ${\Gamma}^{\ast}_G(N)$ related to the conjugacy classes of $G$ contained in $N$ and to the set of primes dividing the sizes…

Group Theory · Mathematics 2024-02-12 Antonio Beltrán , María José Felipe , Carmen Melchor

Topological drawings are representations of graphs in the plane, where vertices are represented by points, and edges by simple curves connecting the points. A drawing is simple if two edges intersect at most in a single point, either at a…

Computational Geometry · Computer Science 2022-09-08 Alfredo García , Alexander Pilz , Javier Tejel

Given a class $\mathcal G$ of graphs, let ${\mathcal G}_n$ denote the set of graphs in $\mathcal G$ on vertex set $[n]$. For certain classes $\mathcal G$, we are interested in the asymptotic behaviour of a random graph $R_n$ sampled…

Combinatorics · Mathematics 2022-09-22 Colin McDiarmid

We appeal to results from combinatorial random matrix theory to deduce that various random graph $\mathrm{C}^*$-algebras are asymptotically almost surely Kirchberg algebras with trivial $K_1$. This in particular implies that, with high…

Operator Algebras · Mathematics 2025-05-22 Bhishan Jacelon , Igor Khavkine

Let $G$ be a simple graph on the vertex set $\{v_1,\dots,v_n\}$ with edge set $E$. Let $K$ be a field. The graphical arrangement $\mathcal{A}_G$ in $K^n$ is the arrangement $x_i-x_j=0, v_iv_j \in E$. An arrangement $\mathcal{A}$ is…

Combinatorics · Mathematics 2015-02-02 Lili Mu , Richard P. Stanley

Let G be a simple, finite, connected, and undirected graph. The middle graph M(G) of G is obtained from the subdivision graph S(G) after joining pairs of subdivided vertices that lie on adjacent edges of G and the central graph C(G) of G is…

Combinatorics · Mathematics 2026-04-09 Amitayu Banerjee , Alexa Gopaulsingh , Zalán Molnár

There has been a great deal of attention recently to graphs whose vertex set is a group, defined using the group structure. (The commuting graph, where two elements are joined if they commute, is the oldest and most famous example.) The…

Combinatorics · Mathematics 2026-02-03 Peter J. Cameron

There are several graphs defined on groups. Among them we consider graphs whose vertex set consists conjugacy classes of a group $G$ and adjacency is defined by properties of the elements of conjugacy classes. In particular, we consider…

Group Theory · Mathematics 2024-03-20 P. J. Cameron , F. E. Jannat , R. K. Nath , R. Sharafdini

We introduce a new class of partial actions of free groups on totally disconnected compact Hausdorff spaces, which we call convex subshifts. These serve as an abstract framework for the partial actions associated with finite separated…

Operator Algebras · Mathematics 2017-05-15 Pere Ara , Matias Lolk

The existence of a connected 12-regular $\{K_4,K_{2,2,2}\}$-ultrahomogeneous graph $G$ is established, (i.e. each isomorphism between two copies of $K_4$ or $K_{2,2,2}$ in $G$ extends to an automorphism of $G$), with the 42 ordered lines of…

Combinatorics · Mathematics 2009-03-29 Italo J. Dejter

We investigate the question how `small' a graph can be, if it contains all members of a given class of locally finite graphs as subgraphs or induced subgraphs. More precisely, we give necessary and sufficient conditions for the existence of…

Combinatorics · Mathematics 2022-05-26 Florian Lehner

In [5] the author conjectures and partially shows that the Cuntz semigroup classifies unitary elements of unital AF-algebras. We provide a complete proof by addressing the existence part of the conjecture, under a mild adjustment of both…

Operator Algebras · Mathematics 2025-03-04 Laurent Cantier

We introduce a class of algebras over a field $\mathbb{F}$ related to directed graphs in which all edges are labeled by nonzero elements of the field $\mathbb{F}$. If all labels are different from $1$, these algebras are axial algebras. We…

Commutative Algebra · Mathematics 2026-03-05 Hans Cuypers

Given a permutation group $G$, the derangement graph of $G$ is defined with vertex set $G$, where two elements $x$ and $y$ are adjacent if and only if $xy^{-1}$ is a derangement. We establish that, if $G$ is transitive with degree exceeding…

Combinatorics · Mathematics 2026-04-15 Marina Cazzola , Louis Gogniat , Pablo Spiga