Binlong Li

activity

20132024

most citedThe stability method, eigenvalues and cycles of consecutive lengths

3 citations · 8 across the 10 of their papers we have counts for

collaborators

Showing math.COShow all

14 papers · 1 filter

math.CO2024

Closures and heavy pairs for hamiltonicity

Wangyi Shang, Hajo Broersma, Shenggui Zhang +1

We say that a graph $G$ on $n$ vertices is ${H, F}$ - $o$ -heavy if every induced subgraph of $G$ isomorphic to $H$ or $F$ contains two nonadjacent vertices with degree sum at least…

math.CO2022

On two cycles of consecutive even lengths

Jun Gao, Binlong Li, Jie Ma +1

Bondy and Vince showed that every graph with minimum degree at least three contains two cycles of lengths differing by one or two.We prove the following average degree counterpart…

math.CO2022

Anti-Ramsey numbers for vertex-disjoint triangles

Fangfang Wu, Shenggui Zhang, Binlong Li +1

An edge-colored graph is called rainbow if all the colors on its edges are distinct. Given a positive integer n and a graph G, the anti-Ramsey number ar(n,G) is the maximum number…

math.CO2021

The Turan problems of directed paths and cycles in digraphs

Wenling Zhou, Binlong Li

Let $P_{k}$ and $C_{k}$ denote the directed path and the directed cycle of order $k$ , respectively. In this paper, we determine the precise maximum si…

math.CO2021★ 3 cited

The stability method, eigenvalues and cycles of consecutive lengths

Binlong Li, Bo Ning

Woodall proved that for a graph $G$ of order $n \geq 2 k + 3$ where $k \geq 0$ is an integer, if $e (G) \geq (2 n - k - 1) + (2 k + 2) + 1$ then $G$ contains a $C_{ℓ}$ for each $\e…

math.CO2020★ 1 cited

The anti-Ramsey number of $C_{3}$ and $C_{4}$ in the complete $r$ -partite graphs

Chunqiu Fang, Ervin Győri, Binlong Li +1

A subgraph of an edge-colored graph is rainbow, if all of its edges have different colors. For a graph $G$ and a family $H$ of graphs, the anti-Ramsey number $ar(G, \math…