【摘要】 综述了超欧拉图的生成子图边数问题,包括该问题的提出及研究发展过程,并罗列了两类公开问题:能否证明边数问题的下确界是35,若不能证明,能否找到更小的下确界?对一些著名的超欧拉图类,如具有两棵边不交的生成树的图等,能否证明其满足Catlin-猜想或35-猜想?更多还原

【Abstract】 In this paper,we survey some results on the problem of number of edges in spanning eulerian subgraphs,including its origin and development of research.Two classes of open problems were posed:Determine whether the infimum of the problem of number of edges in spanning eulerian subgraphs is 35;if false,try for smaller one.Can we do the Catlin-conjecture or 35-conjecture for some famous supereulerian graphs,for example,the graphs with 2 edge-disjoint spanning trees?更多还原