Skip to main content

All Questions

Filter by
Sorted by
Tagged with
2 votes
1 answer
106 views

Hamiltonian path in divisibility graph

Let $\mathbb{N}$ denote the set of positive integers, and consider the graph $(\mathbb{N}, E)$ where a set $\{a,b\}$ of two distinct positive integers belongs to $E$ if there is an integer $k>1$ ...
Dominic van der Zypen's user avatar