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 2011Show all

3 papers · 1 filter

math.CO2011★ 19 cited

Turán numbers for $K_{s, t}$ -free graphs: topological obstructions and algebraic constructions

Pavle Blagojević, Boris Bukh, Roman Karasev

We show that every hypersurface in $R^{s} \times R^{s}$ contains a large grid, i.e., the set of the form $S \times T$ , with $S, T \subset R^{s}$ . We use this to deduce that the known cons…

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…

math.CO2011

Space crossing numbers

Boris Bukh, Alfredo Hubard

We define the crossing number for an embedding of a graph G into R^3, and prove a lower bound on it which almost implies the classical crossing lemma. We also give sharp bounds on…

Turán numbers for Ks,t​-free graphs: topological obstructions and algebraic constructions

Upper bounds for centerlines

Space crossing numbers

Turán numbers for $K_{s, t}$ -free graphs: topological obstructions and algebraic constructions