Nonexistence of universal graphs without some trees
✍ Scribed by Z. Füredi; P. Komjáth
- Book ID
- 105115320
- Publisher
- Springer-Verlag
- Year
- 1997
- Tongue
- English
- Weight
- 470 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0209-9683
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We find an inequality involving the eigenvalues of a regular graph; equality holds if and only if the graph is strongly regular. We apply this inequality to the first subconstituents of a distance-regular graph and obtain a simple proof of the fundamental bound for distance-regular graphs, discovere
## Abstract We investigate tree decompositions (__T__,(__X__~t~)~tϵV(T)~) whose width is “close to optimal” and such that all the subtrees of __T__ induced by the vertices of the graph are “small.” We prove the existence of such decompositions for various interpretations of “close to optimal” and “