Andrii Arman

20 papers A* 1Journal 18
YearRankTypeTitle / Venue / Authors
2026 J jnl
Illumination number of 3-dimensional cap bodies.
Discret. Math.
Andrii Arman, Jaskaran Singh Kaire, Andriy Prymak
2025 J jnl
Convex Bodies of Constant Width with Exponential Illumination Number.
Discret. Comput. Geom.
Andrii Arman, Andrii Bondarenko, Andriy Prymak
2024 J jnl
Minimal dispersion on the cube and the torus.
J. Complex.
Andrii Arman, Alexander E. Litvak
2024 J jnl
Upper Bounds on Chromatic Number of $\mathbb{E}^n$ in Low Dimensions.
Electron. J. Comb.
Andrii Arman, Andriy V. Bondarenko, Andriy Prymak, Danylo V. Radchenko
2023 J jnl
Colorful Matchings.
SIAM J. Discret. Math.
Andrii Arman, Vojtech Rödl, Marcelo Tadeu Sales
2022 J jnl
Every Steiner Triple System Contains Almost Spanning $d$-Ary Hypertree.
Electron. J. Comb.
Andrii Arman, Vojtech Rödl, Marcelo Tadeu Sales
2022 J jnl
Independent Sets in Subgraphs of a Shift Graph.
Electron. J. Comb.
Andrii Arman, Vojtech Rödl, Marcelo Tadeu Sales
2021 J jnl
Every Steiner triple system contains almost spanning d-ary hypertree.
CoRR
Andrii Arman, Vojtech Rödl, Marcelo Tadeu Sales
2021 J jnl
Fast uniform generation of random graphs with given degree sequences.
Random Struct. Algorithms
Andrii Arman, Pu Gao, Nicholas C. Wormald
2021 J jnl
Increasing paths in countable graphs.
J. Comb. Theory A
Andrii Arman, Bradley Elliott, Vojtech Rödl
2021 J jnl
Linear-time uniform generation of random sparse contingency tables with specified marginals.
CoRR
Andrii Arman, Pu Gao, Nicholas C. Wormald
2019 J jnl
A note on weak delta systems.
Discret. Math.
Andrii Arman, Bill Kay, Vojtech Rödl
2019 A* conf
Fast Uniform Generation of Random Graphs with Given Degree Sequences.
FOCS
Andrii Arman, Pu Gao, Nicholas C. Wormald
2019 J jnl
Fast uniform generation of random graphs with given degree sequences.
CoRR
Andrii Arman, Pu Gao, Nicholas C. Wormald
2019 J jnl
The Maximum Number of Cycles in a Graph with Fixed Number of Edges.
Electron. J. Comb.
Andrii Arman, Sergei Tsaturian
2018 J jnl
A result in asymmetric Euclidean Ramsey theory.
Discret. Math.
Andrii Arman, Sergei Tsaturian
2018 — —
Maximum number of cycles in graphs and multigraphs.
Andrii Arman
2017 J jnl
An upper bound for the size of a k-uniform intersecting family with covering number k.
J. Comb. Theory A
Andrii Arman, Troy Retter
2017 J jnl
Note on a Ramsey Theorem for Posets with Linear Extensions.
Electron. J. Comb.
Andrii Arman, Vojtech Rödl
2016 J jnl
Triangle-free graphs with the maximum number of cycles.
Discret. Math.
Andrii Arman, David S. Gunderson, Sergei Tsaturian