◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Linyuan Lu

12 papers hereh-index 215 citations11 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author1
  • middle author7
  • last author4

Across the 12 of 12 papers where every author was matched, so the position is known.

fields
  • math.CO12
same name
  • Linyuan Lu — 102 papers, h 43
  • Linyuan Lu — 11 papers, h 4
  • Linyuan Lu — 11 papers, h 5
  • Linyuan Lu — 8 papers, h 6
  • Linyuan Lu — 5 papers, h 1
  • Linyuan Lu — 1 paper, h 3

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20192026
most citedOn Hamiltonian Berge cycles in 3-uniform hypergraphs

3 citations · 3 across the 12 of their papers we have counts for

collaborators
Showing 2026Show all

4 papers · 1 filter

math.CO2026

On the classification of regular graphs with positive Lin-Lu-Yau curvature

George Brooks, Nathanael Johnson, William Linz +3

We prove several new structural and classification results about d-regular graphs with positive Lin--Lu--Yau (LLY) curvature. We show that any positively curved d-regular graph…

math.CO2026

Maximum spread of Ks,t​-minor-free graphs II: the non-admissible cases

William Linz, Linyuan Lu, Zhiyu Wang

We have previously determined the maximum-spread Ks,t​-minor-free graph(s) on n vertices when n is sufficiently large, 2≤s≤t, and s=2 or $t\ge \frac{3}{2}(s-3) +…

math.CO2026

Generalized Nordhaus--Gaddum Inequalities for Eigenvalues

Sahil Agarwal, Carter Antley, Joseph Aulenbacher +6

For a graph G, let λ1​(G)≥λ2​(G)≥⋯≥λn​(G) denote the adjacency eigenvalues of G. We prove that for all looped graphs G on n vertices, \[λ_1(G) + λ_2(\over…

math.CO2026

Turán-Type Bounds for Graphs Containing Large F-Sparse Sets

Yupei Li, Linyuan Lu

We study Turán-type extremal problems for graphs containing a large F-sparse vertex set, meaning a vertex set whose induced subgraph contains few copies of F. For integers $r>s…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.