Binlong Li

collaborators

2 papers

math.CO2026

Berge tight cycles of all lengths in hypergraphs

Yu Minghui, Li Binlong, Li Ruonan

Given a set $R$ of positive integers, an $R$ -graph $H = (V, E)$ is a hypergraph where the cardinality of each hyperedge belongs to $R$ . If $R = {r}$ , we sometimes refer to the hy…

math.CO2026

On 2-connected graphs without cycles of length 1 modulo 3

Yandong Bai, Hojin Chu, Binlong Li +2

Burr and ErdÅs conjectured in 1976 that for all integers $k > ℓ \geq 0$ such that $k Z + ℓ$ contains an even integer, every $n$ -vertex graph without cycles of length $\el…