Remark on a paper of J. Zaks
โ Scribed by Hansjoachim Walther
- Publisher
- Elsevier Science
- Year
- 1979
- Tongue
- English
- Weight
- 312 KB
- Volume
- 26
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
Let be YY, i = 0, 1,2, the family of all 3-valent 3-connected planar graphs having elementary k-gons only if k = i (mod 3). Improving a result of J. Zaks we can show the inequality
๐ SIMILAR VOLUMES
## Abstract MISRA (1978) sets confidence intervals for a double linear compound of multivariate normal regression coefficients by using ROY'S maximum root test criterion. The exact test statistic to be used is STUDENT'S __t.__ The __t__ statistic gives narrower confidence bounds than those given by
Let M m be a matching with m edges, n 2m. We prove that the smallest number of complete bipartite graphs which partition the edges of K n +M m is at least n&m+w-2mx&1.