◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

V. Taranchuk

20 papers hereh-index 332 citations22 works total

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

author position
  • sole author6
  • first author2
  • middle author2
  • last author10

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

fields
  • math.CO18
  • cs.IT2

identity via Semantic Scholar / OpenAlex

activity
20162026
most citedA New Lower Bound for van der Waerden Numbers

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

collaborators
Showing 2022Show all

2 papers · 1 filter

math.CO2022

A simple proof for the lower bound of the girth of graphs D(n,q)

Vladislav Taranchuk

The components of the graphs D(n,q) provide the best-known general lower bound for the number of edges in a graph with n vertices and no cycles of length less than g. In thi…

math.CO2022

On the eigenvalues of the graphs D(5,q)

Himanshu Gupta, Vladislav Taranchuk

Let q=pe, where p is a prime and e is a positive integer. The family of graphs D(k,q), defined for any positive integer k and prime power q, were introduced by Laze…

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