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 cs.CGShow all

3 papers · 1 filter

cs.CG2018

Consistent sets of lines with no colorful incidence

Boris Bukh, Xavier Goaoc, Alfredo Hubard +1

We consider incidences among colored sets of lines in $R^{d}$ and examine whether the existence of certain concurrences between lines of $k$ colors force the existence of at…

cs.CG2016★ 5 cited

Classifying unavoidable Tverberg partitions

Boris Bukh, Po-Shen Loh, Gabriel Nivasch

Let $T (d, r) = (r - 1) (d + 1) + 1$ be the parameter in Tverberg's theorem, and call a partition $I$ of ${1, 2, \dots, T (d, r)}$ into $r$ parts a "Tverberg type". We say that $\mat…

cs.CG2011

Upper bounds for centerlines

Boris Bukh, Gabriel Nivasch

In 2008, Bukh, Matousek, and Nivasch conjectured that for every n-point set S in R^d and every k, 0 <= k <= d-1, there exists a k-flat f in R^d (a "centerflat") that lies at "depth…