61 citations · 249 across the 42 of their papers we have counts for
41 papers · 1 filter
Covering large-dimensional Euclidean spaces by random translates of a given convex body
Boris Bukh, Jun Gao, Xizhi Liu +2
Determining the minimum density of a covering of by Euclidean unit balls as is a major open problem, with the best known results being the lower bound…
Most frequent subsequences in a word
Boris Bukh, Aleksandre Saatashvili
We prove that every -letter word over -letter alphabet contains some word as a subsequence in at least many ways, and that this is sharp as . F…
The Oddtown problem modulo a composite number
Boris Bukh, Ting-Wei Chao, Zeyu Zheng
A family of subsets of an -element set is called an -Oddtown if the sizes of all sets are not divisible by , but the sizes of pairwise intersections ar…
Maximal sets of a given diameter in Hamming cubes
Boris Bukh, Aleksandre Saatashvili
A subset of the Hamming cube over -letter alphabet is said to be -maximal if its diameter is , and adding any point increases the diameter. Our main result shows that each…
Colouring random subgraphs
Boris Bukh, Michael Krivelevich, Bhargav Narayanan
We study several basic problems about colouring the -random subgraph of an arbitrary graph , focusing primarily on the chromatic number and colouring number of . I…
New bounds for the same-type lemma
Boris Bukh, Alexey Vasileuski
Given finite sets in (with fixed), we prove that there are respective subsets with $|Y_i|\ge \frac{1}{\operatorname{poly}(m)}|X…