pith. sign in

arxiv: 1303.2770 · v1 · pith:CGMXKASOnew · submitted 2013-03-12 · 🧮 math.CO

Signed Graphs and Geometry

classification 🧮 math.CO
keywords graphssignedgeometrybeennotesproofsadequatearise
0
0 comments X
read the original abstract

These lecture notes are a personal introduction to signed graphs, concentrating on the aspects that have been most persistently interesting to me. They are just a few corners of signed graph theory; I am leaving out a great deal. The emphasis is on the way signed graphs arise naturally from geometry, especially from the geometry of the classical root systems. Most of the properties I discuss generalize those of unsigned graphs, but the constructions and proofs are often more complicated. My aim is a coherent presentation of the subject, with a few illustrative proofs and adequate references. Hence the arrangement of the notes is topical with only occasional remarks about the historical course of development. Though this is mainly an expository survey, some of the results have not hitherto been published.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Totally $\Delta$-Modular Tree Decompositions of Graphic Matrices for Integer Programming

    math.CO 2026-02 unverdicted novelty 7.0

    Introduces TDM-treewidth for graphic matrices with two nonzeros per row and proves polynomial-time solvability for bounded-width integer programs with bounded domains, plus a grid theorem analogue.