◍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 2009Show all

2 papers · 1 filter

math.CO2009★ 14 cited

A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs

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

One of the simplest ways to decide whether a given finite sequence of positive integers can arise as the degree sequence of a simple graph is the greedy algorithm of Havel and Haki…

math.CO2009

Degree-based graph construction

Hyunju Kim, Zoltan Toroczkai, Péter L. Erdős +2

Degree-based graph construction is an ubiquitous problem in network modeling, ranging from social sciences to chemical compounds and biochemical reaction networks in the cell. This…

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