加载中…
Simple drawings are drawings of graphs in which two edges have at most one common point (either a common endpoint, or a proper crossing). It has been an open question whether every simple drawing of a complete bipartite graph contains a plane spanning tree as a subdrawing. We answer this question to the positive by showing that for every simple drawing of and for every vertex in that drawing, the drawing contains a shooting star rooted at , that is, a plane spanning tree containing all edges incident to .

生成讲解博客的中文版本

生成AI智能校验的中文版本