Binlong Li

activity

20112026

most citedSpectral analogues of Erdős' and Moon-Moser's theorems on Hamilton cycles

79 citations · 217 across the 44 of their papers we have counts for

collaborators

Showing 2023Show all

2 papers · 1 filter

math.CO2023

On graphs without cycles of length 0 modulo 4

Ervin Győri, Binlong Li, Nika Salia +3

Bollobás proved that for every $k$ and $ℓ$ such that $k Z + ℓ$ contains an even number, an $n$ -vertex graph containing no cycle of length $ℓ mod k$ can contain at…

math.CO2023

A note on universal graphs for spanning trees

Ervin Győri, Binlong Li, Nika Salia +1

Chung and Graham considered the problem of minimizing the number of edges in an $n$ -vertex graph containing all $n$ -vertex trees as a subgraph. They showed that such a graph has at…