◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Andrei Pavelescu

16 papers hereh-index 438 citations19 works total

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

author position
  • sole author2
  • first author6
  • middle author5
  • last author3

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

fields
  • math.CO9
  • math.GT5
  • math.GR1
  • math.RA1
same name
  • Andrei Pavelescu — 1 paper

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
20132026
most citedNew bounds on maximal linkless graphs

4 citations · 13 across the 14 of their papers we have counts for

collaborators
Showing 2024Show all

1 paper · 1 filter

math.CO2024

Intrinsically knotted graphs and connected domination

Gregory Li, Andrei Pavelescu, Elena Pavelescu

We classify all the maximal linklessly embeddable graphs of order 12 and show that their complements are all intrinsically knotted. We derive results about the connected domination…

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