Andrii Arman

According to our database, Andrii Arman authored at least 13 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Upper Bounds on Chromatic Number of $\mathbb{E}^n$ in Low Dimensions.

Andrii Arman, Andriy V. Bondarenko, Andriy Prymak, Danylo V. Radchenko

Electron. J. Comb., 2024

2023

Colorful Matchings.

Andrii Arman, Vojtech Rödl, Marcelo Tadeu Sales

SIAM J. Discret. Math., June, 2023

2022

Every Steiner Triple System Contains Almost Spanning $d$-Ary Hypertree.

Andrii Arman, Vojtech Rödl, Marcelo Tadeu Sales

Electron. J. Comb., 2022

Independent Sets in Subgraphs of a Shift Graph.

Andrii Arman, Vojtech Rödl, Marcelo Tadeu Sales

Electron. J. Comb., 2022

2021

Fast uniform generation of random graphs with given degree sequences.

Andrii Arman, Pu Gao, Nicholas C. Wormald

Random Struct. Algorithms, 2021

Increasing paths in countable graphs.

Andrii Arman, Bradley Elliott, Vojtech Rödl

J. Comb. Theory A, 2021

Linear-time uniform generation of random sparse contingency tables with specified marginals.

Andrii Arman, Pu Gao, Nicholas C. Wormald

CoRR, 2021

2019

A note on weak delta systems.

Andrii Arman, Bill Kay, Vojtech Rödl

Discret. Math., 2019

The Maximum Number of Cycles in a Graph with Fixed Number of Edges.

Andrii Arman, Sergei Tsaturian

Electron. J. Comb., 2019

2018

A result in asymmetric Euclidean Ramsey theory.

Andrii Arman, Sergei Tsaturian

Discret. Math., 2018

2017

An upper bound for the size of a k-uniform intersecting family with covering number k.

Andrii Arman, Troy Retter

J. Comb. Theory A, 2017

Note on a Ramsey Theorem for Posets with Linear Extensions.

Andrii Arman, Vojtech Rödl

Electron. J. Comb., 2017

2016

Triangle-free graphs with the maximum number of cycles.

Andrii Arman, David S. Gunderson, Sergei Tsaturian

Discret. Math., 2016