2 citations · 7 across the 7 of their papers we have counts for
12 papers
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…
Independent sets in subgraphs of a shift graph
Andrii Arman, Vojtěch Rödl, Marcelo Tadeu Sales
Erdős, Hajnal and Szemerédi proved that any subset of vertices of a shift graph has the property that the independence number of the subgraph induced by …
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…