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 2011 · math.COShow all

2 papers · 2 filters

math.CO2011★ 19 cited

Turán numbers for -free graphs: topological obstructions and algebraic constructions

Pavle Blagojević, Boris Bukh, Roman Karasev

We show that every hypersurface in contains a large grid, i.e., the set of the form , with . We use this to deduce that the known cons…

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…