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

48 papers

math.CO2026

Proof of the mad conjecture and its coloring applications

Andrzej Grzesik, Lenka Kopfová, Gaurav Kucheriya +2

For a finite graph $G$ , the maximum average degree $mad (G)$ is the largest average degree of a nonempty subgraph of $G$ . Hendrey, Norin and Wood asked whether this p…

math.CO2026

Maximal anti-Ramsey problems for posets

Binlong Li, Balázs Patkós, Changxin Wang

We study the forbidden poset analog of the maximal anti-Ramsey problem introduced for graphs by Burr, Erd\H os, Graham, and Sós. For integers $m \leq 2^{n}$ and poset $P = (P, ⪯)$ ,…

math.CO2026

Towards a strengthening of the second neighborhood conjecture

Yandong Bai, Binlong Li, Boram Park

A longstanding conjecture of Seymour, called Seymour's second neighborhood conjecture, states that every oriented graph $D$ contains a vertex $x$ with $|N^{++}_D(x)|\geq |N^{+}_D(x…

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 $\ell…

math.CO2025

Cycle lengths in graphs of given minimum degree

Yandong Bai, Andrzej Grzesik, Binlong Li +1

We prove that if $G$ is a 2-connected graph with minimum degree at least $k ⩾ 4$ , then (1) $G$ contains $k$ cycles whose lengths form an arithmetic progression with common d…