◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

V. Zamaraev

3 papers hereh-index 7129 citations19 works total

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

author position
  • middle author1
  • last author2

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

fields
  • cs.DM2
  • math.CO1
same name
  • V. Zamaraev — 16 papers, h 12

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

most citedWell-quasi-ordering does not imply bounded clique-width

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

collaborators
Showing math.COShow all

1 paper · 1 filter

math.CO2017

Infinitely many minimal classes of graphs of unbounded clique-width

A. Collins, J. Foniok, N. Korpelainen +2

The celebrated theorem of Robertson and Seymour states that in the family of minor-closed graph classes, there is a unique minimal class of graphs of unbounded tree-width, namely,…

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