Three observations on the Colin de Verdière spectral graph parameter
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916457115287552 |
|---|---|
| author | Kaluža, Vojtěch Koval, Vadym |
| author_facet | Kaluža, Vojtěch Koval, Vadym |
| contents | In this small note, we collect several observations pertaining to the famous spectral graph parameter $μ$ introduced in 1990 by Y. Colin de Verdière. This parameter is defined as the maximum corank among certain matrices akin to weighted Laplacians; we call them CdV matrices.
First, we answer negatively a question mentioned in passing in the influential 1996 survey on $μ$ by van der Holst, Lovász, and Schrijver concerning the Perron--Frobenious eigenvector of CdV matrices.
Second, by definition, CdV matrices posses certain transversality property. In some cases, this property is known to be satisfied automatically. We add one such case to the list.
Third, Y. Colin de Verdière conjectured an upper bound on $μ(G)$ for graphs embeddable into a fixed closed surface. Following a recent computer-verified counterexample to a continuous version of the conjecture by Fortier Bourque, Gruda-Mediavilla, Petri, and Pineault [arXiv:2312.03504], we also check using computer that the analogous example shows the failure of the conjectured upper bound on $μ(G)$ for graphs embeddable into 10-torus as well as to several other larger surfaces. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_21226 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Three observations on the Colin de Verdière spectral graph parameter Kaluža, Vojtěch Koval, Vadym Combinatorics Discrete Mathematics Spectral Theory In this small note, we collect several observations pertaining to the famous spectral graph parameter $μ$ introduced in 1990 by Y. Colin de Verdière. This parameter is defined as the maximum corank among certain matrices akin to weighted Laplacians; we call them CdV matrices. First, we answer negatively a question mentioned in passing in the influential 1996 survey on $μ$ by van der Holst, Lovász, and Schrijver concerning the Perron--Frobenious eigenvector of CdV matrices. Second, by definition, CdV matrices posses certain transversality property. In some cases, this property is known to be satisfied automatically. We add one such case to the list. Third, Y. Colin de Verdière conjectured an upper bound on $μ(G)$ for graphs embeddable into a fixed closed surface. Following a recent computer-verified counterexample to a continuous version of the conjecture by Fortier Bourque, Gruda-Mediavilla, Petri, and Pineault [arXiv:2312.03504], we also check using computer that the analogous example shows the failure of the conjectured upper bound on $μ(G)$ for graphs embeddable into 10-torus as well as to several other larger surfaces. |
| title | Three observations on the Colin de Verdière spectral graph parameter |
| topic | Combinatorics Discrete Mathematics Spectral Theory |
| url | https://arxiv.org/abs/2410.21226 |