English

The Strong Arnold Property for 4-connected flat graphs

Combinatorics 2015-12-11 v1

Abstract

We show that if G=(V,E)G=(V,E) is a 4-connected flat graph, then any real symmetric V×VV\times V matrix MM with exactly one negative eigenvalue and satisfying, for any two distinct vertices ii and jj, Mij<0M_{ij}<0 if ii and jj are adjacent, and Mij=0M_{ij}=0 if ii and jj are nonadjacent, has the Strong Arnold Property: there is no nonzero real symmetric V×VV\times V matrix XX with MX=0MX=0 and Xij=0X_{ij}=0 whenever ii and jj are equal or adjacent. (A graph GG is {\em flat} if it can be embedded injectively in 33-dimensional Euclidean space such that the image of any circuit is the boundary of some disk disjoint from the image of the remainder of the graph.) This applies to the Colin de Verdi\`ere graph parameter, and extends similar results for 2-connected outerplanar graphs and 3-connected planar graphs.

Keywords

Cite

@article{arxiv.1512.03200,
  title  = {The Strong Arnold Property for 4-connected flat graphs},
  author = {Alexander Schrijver and Bart Sevenster},
  journal= {arXiv preprint arXiv:1512.03200},
  year   = {2015}
}
R2 v1 2026-06-22T12:06:10.525Z