Jiaxi Nie

Abstract:A set of geometric graphs is geometric-packable if it can be asymptotically packed into every sequence of drawings of the complete graph K_n. For example, the set of geometric triangles is geometric-packable due to the existence of Steiner...

Given a finite simple graph $G$, an {\em odd cover of $G$} is a collection of complete bipartite graphs, or bicliques, in which each edge of $G$ appears in an odd number of bicliques and each non-edge of $G$ appears in an even number of bicliques. We...