4 citations · 14 across the 23 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
math.NT2018★ 1 cited
On the Erdős Covering Problem: the density of the uncovered set
Paul Balister, Béla Bollobás, Robert Morris +2
Since their introduction by Erdős in 1950, covering systems (that is, finite collections of arithmetic progressions that cover the integers) have been extensively studied, and nume…
math.CO2018
Judiciously 3-partitioning 3-uniform hypergraphs
Hunter Spink, Marius Tiba
Bollobás, Reed and Thomason proved every -uniform hypergraph with edges has a vertex-partition such that each part m…
math.CO2018★ 1 cited
Solvability of Mazes by Blind Robots
Stefan David, Marius Tiba
In this paper we introduce and investigate a new type of automata which turns out to be rich in deep and complex phenomena. For our model, a maze is a countable strongly connected…