2 citations · 6 across the 5 of their papers we have counts for
9 papers · 1 filter
Every Steiner triple system contains an almost spanning d-ary hypertree
Andrii Arman, Vojtěch Rödl, Marcelo Tadeu Sales
In this paper we make a partial progress on the following conjecture: for every and large enough , every Steiner triple system on at least vertices contains e…
Linear-time uniform generation of random sparse contingency tables with specified marginals
Andrii Arman, Pu Gao, Nicholas Wormald
We give an algorithm that generates a uniformly random contingency table with specified marginals, i.e. a matrix with non-negative integer values and specified row and column sums.…
Colourful matchings
Andrii Arman, Vojtěch Rödl, Marcelo Tadeu Sales
Suppose a committee consisting of three members has to match candidates to different positions. Each member of the committee proposes a matching, however the proposed match…
Increasing paths in countable graphs
Andrii Arman, Bradley Elliott, Vojtěch Rödl
In this paper we study variations of an old result by Müller, Reiterman, and the last author stating that a countable graph has a subgraph with infinite degrees if and only if in a…
Fast uniform generation of random graphs with given degree sequences
Andrii Arman, Pu Gao, Nicholas Wormald
In this paper we provide an algorithm that generates a graph with given degree sequence uniformly at random. Provided that , where is the maximal degree and is th…
Properties of the Fibonacci-sum graph
Andrii Arman, David S. Gunderson, Pak Ching Li
For each positive integer , the Fibonacci-sum graph on vertices is defined by two vertices forming an edge if and only if they sum to a Fibonacci number. It…