Zequn Lv

According to our database1, Zequn Lv authored at least 16 papers between 2021 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Hilton-Milner theorem for k-multisets.
Discret. Math., 2026

Treewidth of Generalized Hamming Graph, Bipartite Kneser Graph and Generalized Petersen Graph.
Electron. J. Comb., 2026

2025
Exact Results for Generalized Extremal Problems Forbidding an Even Cycle.
J. Graph Theory, 2025

2024
Generalized Turán numbers for the edge blow-up of a graph.
Discret. Math., January, 2024

Treewidth of the q-Kneser graphs.
Discret. Appl. Math., January, 2024

The maximum number of copies of an even cycle in a planar graph.
J. Comb. Theory B, 2024

Erdős-Ko-Rado theorem for bounded multisets.
J. Comb. Theory, Ser. A, 2024

Extremal Results for Graphs Avoiding a Rainbow Subgraph.
Electron. J. Comb., 2024

Many triangles in C5-free graphs.
Adv. Appl. Math., 2024

2023
Edges Not Covered by Monochromatic Bipartite Graph.
SIAM J. Discret. Math., December, 2023

Autonomous Planning Algorithm for Satellite Laser Ranging Tasks Based on Rolling Horizon Optimization Framework.
Remote. Sens., August, 2023

Saturation numbers for disjoint stars.
J. Comb. Optim., 2023

Minimum tP3-saturation graphs.
Discret. Appl. Math., 2023

2022
Perfect Matching and Hamilton Tight Cycle Decomposition of Complete $n$-Balanced $r$-Partite $k$-Uniform Hypergraphs.
SIAM J. Discret. Math., 2022

Density of Balanced 3-Partite Graphs without 3-Cycles or 4-Cycles.
Electron. J. Comb., 2022

2021
The terminal-pairability problem in complete bipartite graphs.
Discret. Appl. Math., 2021


  Loading...