Abstract
On path partitions of the divisor graph. Let D(x) be the graph with vertices {1, 2, ..., ⌊x⌋} whose edges come from the division relation, and let D(x, y) be the subgraph restricted to the integers with prime factors less than or equal to y. We give sufficient conditions on x and y for the graph D(x, y) to be Hamiltonian. We deduce an asymptotic formula for the number of paths in D(x) needed to partition the set of vertices {1, 2, ..., ⌊x⌋}.
Monthly Content Usage
| Abstract Views | Full Text Views | PDF Downloads | |
|---|---|---|---|
| Nov 2020 | 0 | 0 | 0 |
| Dec 2020 | 1 | 0 | 0 |
| Jan 2021 | 0 | 0 | 0 |
| Feb 2021 | 0 | 0 | 0 |
| Mar 2021 | 0 | 0 | 0 |
| Apr 2021 | 0 | 0 | 0 |
| May 2021 | 0 | 0 | 0 |
Copyright Akadémiai Kiadó
AKJournals is the trademark of Akadémiai Kiadó's journal publishing business branch.
Copyright Akadémiai Kiadó AKJournals is the trademark of Akadémiai Kiadó's journal publishing business branch.
Powered by PubFactory