Leilei Zhang

activity

20212026

most citedProof of a conjecture on hamiltonian-connected graphs

1 citations · 1 across the 17 of their papers we have counts for

collaborators

Showing 2026Show all

8 papers · 1 filter

math.CO2026

A proof of the strong Erdős--Frankl--Füredi cover-free conjecture

Yanan Hu, Leilei Zhang

A family of nonempty sets is $r$ -cover-free if no member is contained in the union of at most $r$ other members. Let $T (r)$ denote the least $n$ for which there is an $r$ -cover-fre…

math.CO2026

Further Results on the Maximum Number of Stars in Graphs with Forbidden Properties

Yuxuan Liu, Jia-Bao Yang, Leilei Zhang

A graph $G$ is called $k$ -edge-hamiltonian if every linear forest (i.e., a disjoint union of paths) with at most $k$ edges is contained in a Hamilton cycle of $G$ . In 2018, Füredi,…

math.CO2026

Counterexamples to the Balogh-Linz-Patkós Conjecture

Jia-Bao Yang, Leilei Zhang

A set system $F$ is called $t$ -intersecting if $∣ A \cap B ∣ \geq t$ for every pair of sets $A, B \in F .$ A set system $F$ is $k$ -Sperner if it does not cont…

math.CO2026

On the distinct maximal-clique sizes in $k$ -uniform hypergraphs

Jiabao Yang, Lixiang Yu, Leilei Zhang

Let $g (n, k)$ be the maximum number of distinct sizes of maximal cliques in an $n$ -vertex $k$ -uniform hypergraph, and let $f (n, k) = n - g (n, k)$ . We determine the asymptotic order of $f(…

math.CO2026

The maximum number of triangles in graphs without vertex disjoint friendship graphs

Wanfang Chen, Jia-Bao Yang, Leilei Zhang

Given graphs $H$ and $F$ , the generalized Turán number $ex (n, H, F)$ is the maximum number of copies of $H$ among all $n$ -vertex $F$ -free graphs. The friendship graph $F_{k}$ …

math.CO2026

Hamiltonian Properties of 3-Connected Claw-Free Graphs and Line Graphs of 3-Hypergraphs

Kenta Ozeki, Leilei Zhang

Motivated by Thomassen's well-known line graph conjecture, many researchers have explored sufficient conditions for claw-free graphs to be Hamiltonian or Hamilton-connected. In 199…

math.CO2026

A Note on Grünbaum's Conjecture about Longest Cycles and Paths

Masaki Kashima, Kenta Ozeki, Leilei Zhang

Let $c (G)$ denote the circumference of a graph $G$ , i.e., the number of vertices in its longest cycle. For positive integers $n$ and $k$ with $n > k$ , let $Γ (n; k)$ be the cla…

math.CO2026

Stability results for Berge-matching in hypergraphs

Jia-Bao Yang, Leilei Zhang

Given a graph $F$ , a hypergraph is called a Berge- $F$ if it can be obtained by expanding each edge of $F$ into a hyperedge containing it. Let $M_{k}$ denote the matching of size $k…

A proof of the strong Erdős--Frankl--Füredi cover-free conjecture

Further Results on the Maximum Number of Stars in Graphs with Forbidden Properties

Counterexamples to the Balogh-Linz-Patkós Conjecture

On the distinct maximal-clique sizes in k-uniform hypergraphs

The maximum number of triangles in graphs without vertex disjoint friendship graphs

Hamiltonian Properties of 3-Connected Claw-Free Graphs and Line Graphs of 3-Hypergraphs

A Note on Grünbaum's Conjecture about Longest Cycles and Paths

Stability results for Berge-matching in hypergraphs

On the distinct maximal-clique sizes in $k$ -uniform hypergraphs