2 papers
math.GT2021
The Complement Problem for Linklessly Embeddable Graphs
Ramin Naimi, Ryan Odeneal, Andrei Pavelescu +1
We find all maximal linklessly embeddable graphs of order up to 11, and verify that for every graph of order 11 either or its complement is intrinsically linked. We gi…
math.CO2019
Simple Graphs of Order 12 and Minimum Degree 6 Contain K_6 Minors
Ryan Odeneal, Andrei Pavelescu
We prove that every simple graph of order 12 which has minimum degree 6 contains a K_6 minor.