B. Bukh

activity

20072026

most citedA bound on the number of edges in graphs without an even cycle

61 citations · 249 across the 42 of their papers we have counts for

collaborators

Showing 2021 · math.COShow all

3 papers · 2 filters

math.CO2021

Sharp density bounds on the finite field Kakeya problem

Boris Bukh, Ting-Wei Chao

A Kakeya set in $F_{q}^{n}$ is a set containing a line in every direction. We show that every Kakeya set in $F_{q}^{n}$ has density at least $1/ 2^{n - 1}$ , matching the con…

math.CO2021★ 2 cited

Extremal graphs without exponentially-small bicliques

Boris Bukh

The Turán problem asks for the largest number of edges in an $n$ -vertex graph not containing a fixed forbidden subgraph $F$ . We construct a new family of graphs not containing $K_{…

math.CO2021

Digital almost nets

Boris Bukh, Ting-Wei Chao

Digital nets (in base $2$ ) are the subsets of $[0, 1]^{d}$ that contain the expected number of points in every not-too-small dyadic box. We construct sets that contain almost the expe…