activity
20192021
most citedSpectral extrema of graphs with fixed size: cycles and complete bipartite graphs

6 citations · 12 across the 7 of their papers we have counts for

collaborators

9 papers

math.CO20211 cited

Outerplanar Turán numbers of cycles and paths

Longfei Fang, Mingqing Zhai

A graph is outerplanar if it can be embedded in a plane such that all vertices lie on its outer face. The outerplanar Turán number of a given graph , denoted by ${\rm ex}_{\math…

math.CO2021

Spectral radius, edge-disjoint cycles and cycles of the same length

Huiqiu Lin, Mingqing Zhai, Yanhua Zhao

In this paper, we give spectral conditions to guarantee the existence of two edge disjoint cycles and two cycles of the same length. These two results can be seen as spectral analo…

math.CO20215 cited

Spectral extrema of -minor free graphs--On a conjecture of M. Tait

Mingqing Zhai, Huiqiu Lin

Minors play an important role in extremal graph theory and spectral extremal graph theory. Tait [The Colin de Verdière parameter, excluded minors, and the spectral radius, J. Combi…

math.CO20216 cited

Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs

Mingqing Zhai, Huiqiu Lin, Jinlong Shu

Nikiforov [Some inequalities for the largest eigenvalue of a graph, Combin. Probab. Comput. 179--189] showed that if is -free then the spectral radius $ρ(G)\leq\sqrt{2…

math.CO2021

A strengthening of the spectral chromatic critical edge theorem: books and theta graphs

Mingqing Zhai, Huiqiu Lin

The chromatic critical edge theorem of Simonovits states that for a given color critical graph with , there exists an such that the Turán graph is…

math.CO2020

Planar Turán Number of intersecting triangles

Longfei Fang, Mingqing Zhai, Bing Wang

The planar Turán number of a given graph , denoted by , is the maximum number of edges over all planar graphs on vertices that do not contain a copy o…