◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Benny Sudakov

11 papers hereh-index 6123 citations15 works total

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

author position
  • sole author1
  • last author10

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

fields
  • math.CO10
  • cs.CC1
same name
  • Benny Sudakov — 36 papers, h 6
  • Benny Sudakov — 3 papers
  • Benny Sudakov — 3 papers, h 2
  • Benny Sudakov — 1 paper, h 3
  • Benny Sudakov — 1 paper, h 5

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
20102026
most citedApproximate path decompositions of regular graphs

1 citations · 2 across the 10 of their papers we have counts for

collaborators
Showing 2020Show all

1 paper · 1 filter

math.CO2020

A proof of Ringel's Conjecture

Richard Montgomery, Alexey Pokrovskiy, Benny Sudakov

A typical decomposition question asks whether the edges of some graph G can be partitioned into disjoint copies of another graph H. One of the oldest and best known conjectures…

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