◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

P. Erdős

28 papers hereh-index 262.2k citations109 works total

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

author position
  • first author18
  • middle author9

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

fields
  • math.CO24
  • cs.DM1
  • cs.DS1
  • cs.SI1
  • q-fin.PR1

identity via Semantic Scholar / OpenAlex

activity
20092024
most citedA class of phylogenetic networks reconstructable from ancestral profiles

36 citations · 216 across the 28 of their papers we have counts for

collaborators
Showing 2016Show all

1 paper · 1 filter

math.CO2016★ 2 cited

Not all simple looking degree sequence problems are easy

Péter L. Erdős, István Miklós

Degree sequence (DS) problems are around for at least hundred twenty years, and with the advent of network science, more and more complicated, structured DS problems were invented.…

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