4 problems

Let $K_n$ be the complete graph on $n$ vertices, and let antithickness be the minimum number of thrackles in an edge-partition of a graph. Complete-graph antithickness conjecture.…

For a graph, book thickness is the minimum number of pages in a book embedding, and convex antithickness is the minimum number of convex geometric thrackles in a straight-line draw…

For a graph, geometric thickness is the minimum number of plane geometric layers in a straight-line drawing, and geometric antithickness is the minimum number of geometric thrackle…

Let $G_n$ be the graph whose vertices are the singleton and tripleton subsets of an $n$-element set, with two subsets adjacent when one is contained in the other. Geometric antithi…