Andrii Arman

From MaRDI portal
(Redirected from Andrii Arman)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Convex bodies of constant width with exponential illumination number
(available as arXiv preprint)
N/APaper
On Hadwiger's covering problem in small dimensions
(available as arXiv preprint)
N/APaper
Illumination number of 3-dimensional cap bodies
Discrete Mathematics
2026-03-30Paper
Small volume bodies of constant width with tetrahedral symmetries
SIGMA. Symmetry, Integrability and Geometry: Methods and Applications
2026-01-26Paper
A construction of spherical 5-designs with O(d^2) points
(available as arXiv preprint)
2026-01-01Paper
Small volume bodies of constant width
IMRN. International Mathematics Research Notices
2025-10-08Paper
Fast uniform generation of random graphs with given degree sequences2025-08-12Paper
Convex bodies of constant width with exponential illumination number
Discrete & Computational Geometry
2025-07-07Paper
On a Gallai-type problem and illumination of spiky balls and cap bodies
Mathematika
2025-04-02Paper
Hadwiger's conjecture for cap bodies
(available as arXiv preprint)
2025-01-01Paper
On asymptotic Lebesgue's universal covering problem
(available as arXiv preprint)
2025-01-01Paper
Linear-time uniform generation of random sparse contingency tables with specified marginals
The Annals of Applied Probability
2024-08-21Paper
Upper bounds on chromatic number of \(\mathbb{E}^n\) in low dimensions
The Electronic Journal of Combinatorics
2024-07-18Paper
Small volume bodies of constant width
(available as arXiv preprint)
2024-01-01Paper
Small volume bodies of constant width with tetrahedral symmetries
(available as arXiv preprint)
2024-01-01Paper
On a Gallai-type problem and illumination of spiky balls and cap bodies
(available as arXiv preprint)
2024-01-01Paper
Fast uniform generation of random graphs with given degree sequences
Random Structures & Algorithms
2023-10-12Paper
Colorful Matchings
SIAM Journal on Discrete Mathematics
2023-06-14Paper
Every Steiner triple system contains almost spanning \(d\)-ary hypertree
The Electronic Journal of Combinatorics
2022-08-04Paper
Independent sets in subgraphs of a shift graph
The Electronic Journal of Combinatorics
2022-04-04Paper
Upper bounds on chromatic number of $\mathbb{E}^n$ in low dimensions2021-12-26Paper
Increasing paths in countable graphs
Journal of Combinatorial Theory. Series A
2021-07-14Paper
Linear-time uniform generation of random sparse contingency tables with specified marginals2021-04-19Paper
The maximum number of cycles in a graph with fixed number of edges
The Electronic Journal of Combinatorics
2019-12-09Paper
The maximum number of cycles in a graph with fixed number of edges
The Electronic Journal of Combinatorics
2019-12-09Paper
A note on weak delta systems
Discrete Mathematics
2019-09-11Paper
A result in asymmetric Euclidean Ramsey theory
Discrete Mathematics
2018-04-05Paper
Note on a Ramsey theorem for posets with linear extensions
The Electronic Journal of Combinatorics
2017-12-12Paper
Note on a Ramsey theorem for posets with linear extensions
The Electronic Journal of Combinatorics
2017-12-12Paper
Properties of the Fibonacci-sum graph2017-10-27Paper
Equally spaced collinear points in Euclidean Ramsey theory2017-05-12Paper
An upper bound for the size of a \(k\)-uniform intersecting family with covering number \(k\)
Journal of Combinatorial Theory. Series A
2017-01-09Paper
Equally spaced collinear points in Euclidean Ramsey theory
(available as arXiv preprint)
2017-01-01Paper
Properties of the Fibonacci-sum graph
(available as arXiv preprint)
2017-01-01Paper
Triangle-free graphs with the maximum number of cycles
Discrete Mathematics
2015-12-08Paper


Research outcomes over time


This page was built for person: Andrii Arman