◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Florian Lehner

39 papers hereh-index 12349 citations57 works total

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

author position
  • sole author9
  • first author10
  • middle author14
  • last author6

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

fields
  • math.CO35
  • cs.DM1
  • cs.FL1
  • math.GR1
  • math.PR1
same name
  • Florian Lehner — 5 papers, h 2
  • Florian Lehner — 5 papers, h 1
  • Florian Lehner — 3 papers, h 1

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
20112026
most citedA bound for the distinguishing index of regular graphs

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

collaborators
Showing 2011Show all

1 paper · 1 filter

math.CO2011

On spanning tree packings of highly edge connected graphs

Florian Lehner

We prove a refinement of the tree packing theorem by Tutte/Nash-Williams for finite graphs. This result is used to obtain a similar result for end faithful spanning tree packings i…

◍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.