Study of the divisor graph. III (Q2569660)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2216793
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Study of the divisor graph. III |
scientific article; zbMATH DE number 2216793 |
Statements
Study of the divisor graph. III (English)
0 references
20 October 2005
0 references
Let \(F(N)\) be the least number of the number of elements of a partition of \(\{1, 2, \dots, N\}\) into simple paths of its divisor graph. Then the author shows that \(N/6\leq F(N)<N/4\), the lower bound being valid for all \(N\geq 1\), and the upper bound for \(N\) large enough. For results in the first two parts, see Period. Math. Hung. 32, 219--228 (1996; Zbl 0860.11058) and Monatsh. Math. 137, No. 4, 301--312 (2002; Zbl 1009.05084).
0 references
divisor graph
0 references
0 references
0 references
0 references
0 references
0 references
0.8668974
0 references
0 references
