◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Andrii Arman

3 papers here

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

author position
  • first author3

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

fields
  • math.MG2
  • math.CO1
ORCID 0000-0003-1462-5733

identity via Semantic Scholar / OpenAlex

most citedTriangle-free graphs with the maximum number of cycles

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

collaborators

3 papers

math.MG2024

Minimal dispersion on the cube and the torus

Andrii Arman, Alexander E. Litvak

We improve some upper bounds for minimal dispersion on the cube and torus. /Our new ingredient is an improvement of a probabilistic lemma used to obtain upper bounds for dispersion…

math.MG2024

On Hadwiger's covering problem in small dimensions

Andrii Arman, Andriy Bondarenko, Andriy Prymak

Let Hn​ be the minimal number such that any n-dimensional convex body can be covered by Hn​ translates of interior of that body. Similarly Hns​ is the corresponding quanti…

math.CO2015★ 1 cited

Triangle-free graphs with the maximum number of cycles

Andrii Arman, David S. Gunderson, Sergei Tsaturian

It is shown that for n≥141, among all triangle-free graphs on n vertices, the complete equibipartite graph is the unique triangle-free graph with the greatest number of cyc…

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