Is it Possible to have an infinite number of divisibility graphs containing $K_5$ or $K_{3,3}$?

63 Views Asked by At

I came across this post: How does the divisibility graphs work?

Where you can make a divisibility graph for any number n, using the method in the answer. Is it possible to have a divisibility graph that will always have a $K_5$ or $K_{3,3}$?