Andrii Arman

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 16

Top Topics

Lyapunov Stability

Top Venues

Electron. J. Comb.

J. Comb. Theory, Ser. A

Publications

Andrii Arman, Andriy V. Bondarenko, Andriy Prymak, Danylo V. Radchenko
Upper Bounds on Chromatic Number of $\mathbb{E}^n$ in Low Dimensions. Electron. J. Comb. 31 (2) (2024)
Andrii Arman, Vojtech Rödl, Marcelo Tadeu Sales
Colorful Matchings. SIAM J. Discret. Math. 37 (2) (2023)
Andrii Arman, Vojtech Rödl, Marcelo Tadeu Sales
Every Steiner Triple System Contains Almost Spanning $d$-Ary Hypertree. Electron. J. Comb. 29 (3) (2022)
Andrii Arman, Vojtech Rödl, Marcelo Tadeu Sales
Independent Sets in Subgraphs of a Shift Graph. Electron. J. Comb. 29 (1) (2022)
Andrii Arman, Pu Gao, Nicholas C. Wormald
Fast uniform generation of random graphs with given degree sequences. Random Struct. Algorithms 59 (3) (2021)
Andrii Arman, Bradley Elliott, Vojtech Rödl
Increasing paths in countable graphs. J. Comb. Theory, Ser. A 183 (2021)
Andrii Arman, Vojtech Rödl, Marcelo Tadeu Sales
Every Steiner triple system contains almost spanning d-ary hypertree. CoRR (2021)
Andrii Arman, Pu Gao, Nicholas C. Wormald
Linear-time uniform generation of random sparse contingency tables with specified marginals. CoRR (2021)
Andrii Arman, Bill Kay, Vojtech Rödl
A note on weak delta systems. Discret. Math. 342 (11) (2019)
Andrii Arman, Pu Gao, Nicholas C. Wormald
Fast Uniform Generation of Random Graphs with Given Degree Sequences. FOCS (2019)
Andrii Arman, Sergei Tsaturian
The Maximum Number of Cycles in a Graph with Fixed Number of Edges. Electron. J. Comb. 26 (4) (2019)
Andrii Arman, Pu Gao, Nicholas C. Wormald
Fast uniform generation of random graphs with given degree sequences. CoRR (2019)
Andrii Arman, Sergei Tsaturian
A result in asymmetric Euclidean Ramsey theory. Discret. Math. 341 (5) (2018)
Andrii Arman, Vojtech Rödl
Note on a Ramsey Theorem for Posets with Linear Extensions. Electron. J. Comb. 24 (4) (2017)
Andrii Arman, Troy Retter
An upper bound for the size of a k-uniform intersecting family with covering number k. J. Comb. Theory, Ser. A 147 (2017)
Andrii Arman, David S. Gunderson, Sergei Tsaturian
Triangle-free graphs with the maximum number of cycles. Discret. Math. 339 (2) (2016)