◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

O. Verbitsky

9 papers hereh-index 19987 citations78 works total

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

author position
  • sole author1
  • last author8

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

fields
  • math.CO4
  • math.LO3
  • cs.CC1
  • cs.DM1

identity via Semantic Scholar / OpenAlex

activity
20012005
most citedDescriptive Complexity of Finite Structures: Saving the Quantifier Rank

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

collaborators
Showing 2001 · cs.DMShow all

1 paper · 2 filters

cs.DM2001

A Symmetric Strategy in Graph Avoidance Games

Frank Harary, Wolfgang Slany, Oleg Verbitsky

In the graph avoidance game two players alternatingly color edges of a graph G in red and in blue respectively. The player who first creates a monochromatic subgraph isomorphic to…

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