View More View Less
  • 1 Université Bordeaux I, UMR 5251 351 cours de la Libération F-33 405 Talence cedex France
Restricted access


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⌋}.

All Time Past Year Past 30 Days
Abstract Views 8 8 0
Full Text Views 0 0 0
PDF Downloads 0 0 0