◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Fedor Manin

1 paper hereh-index 9155 citations32 works total

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

author position
  • sole author1

Across the 1 of 1 paper where every author was matched, so the position is known.

fields
  • cs.CC1

identity via Semantic Scholar / OpenAlex

most citedThe complexity of nonrepetitive edge coloring of graphs

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

collaborators
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2007★ 8 cited

The complexity of nonrepetitive edge coloring of graphs

Fedor Manin

A squarefree word is a sequence w of symbols such that there are no strings x,y, and z for which w=xyyz. A nonrepetitive coloring of a graph is an edge coloring in which t…

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