Speaker：Fengming Dong (Nanyang Technological University)

Time：2025-5-16, 10:00

Location：Conference Room C610 at Administration Building at Haiyun Campus 

Abstract:

A 1-plane graph is a graph together with a drawing in the plane in such a way that each edge is crossed at most once. A 1-plane graph is maximal if no edge can be added without violating its 1-planarity or simplicity. Let m(n) denote the minimum size of a maximal 1-plane graph of order n. In this talk, I will introduce our recent work on determining m(n). The new result is from the joint article with Professors Huang Yuanqiu, Ouyang Zhangdong, and Dr. Zhang Licheng.