MAT-free graphic arrangements and a characterization of strongly chordal graphs by edge-labeling

DOI10.5802/alco.319arXiv2204.08878OpenAlexW4390659556MaRDI QIDQ6119506

Tan Nhat Tran, Shuhei Tsujie

Publication date: 1 March 2024

Published in: Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2204.08878

zbMATH Keywords

hyperplane arrangementstrongly chordal graphfree arrangementgraphic arrangementideal subarrangementedge-labeling of graphMAT-free arrangement

Mathematics Subject Classification ID

Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Derivations and commutative rings (13N15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Unnamed Item
• Unnamed Item
• The freeness of ideal subarrangements of Weyl arrangements
• Characterizing and computing the structure of clique intersections in strongly chordal graphs
• On rigid circuit graphs
• Freeness of hyperplane arrangements between Boolean arrangements and Weyl arrangements of type \(B_{\ell}\)
• Characterizations of strongly chordal graphs
• Generalized exponents of a free arrangement of hyperplanes and Shepherd- Todd-Brieskorn formula
• Counting clique trees and computing perfect elimination schemes in parallel
• Free hyperplane arrangements between \(A_{n-1}\) and \(B_ n\)
• Signed graphs and the freeness of the Weyl subarrangements of type \(B_\ell\)
• Worpitzky-compatible subarrangements of braid arrangements and cocomparability graphs
• Accurate arrangements
• MAT-free reflection arrangements
• Incidence matrices and interval graphs
• Supersolvable lattices
• Unit ball graphs on geodesic spaces
• Multiple addition, deletion and restriction theorems for hyperplane arrangements
• Exponents for 𝐵-stable ideals
• An introduction to chromatic polynomials

This page was built for publication: MAT-free graphic arrangements and a characterization of strongly chordal graphs by edge-labeling