◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

John Lapinskas

21 papers hereh-index 12337 citations30 works total

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

author position
  • middle author15
  • last author6

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

fields
  • math.PR8
  • cs.DS5
  • math.CO4
  • cs.CC3
  • cs.DC1

identity via Semantic Scholar / OpenAlex

activity
20122026
most citedProof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments

31 citations · 62 across the 15 of their papers we have counts for

collaborators
Showing 2013Show all

1 paper · 1 filter

math.CO2013★ 31 cited

Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments

Daniela Kühn, John Lapinskas, Deryk Osthus +1

A conjecture of Thomassen from 1982 states that for every k there is an f(k) so that every strongly f(k)-connected tournament contains k edge-disjoint Hamilton cycles. A classical…

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