Monotonicity in graph searching
โ Scribed by D Bienstock; Paul Seymour
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 381 KB
- Volume
- 12
- Category
- Article
- ISSN
- 0196-6774
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## Abstract The __k__th __moment__ of the degree sequence __d__~1~โโฅโ__d__~2~โโฅโโฆ__d__~n~ of a graph __G__ is $\mu \_k(G)={1\over n}{\sum}{d\_i^k}$. We give asymptotically sharp bounds for ฮผ~k~(__G__) when __G__ is in a monotone family. We use these results for the case __k__โ=โ2 to improve a resul
## Abstract Let __G__ be a graph drawn in the plane so that its edges are represented by __x__โmonotone curves, any pair of which cross an even number of times. We show that __G__ can be redrawn in such a way that the __x__โcoordinates of the vertices remain unchanged and the edges become nonโcross