activity
20092026
most citedCounting flags in triangle-free digraphs

25 citations · 246 across the 55 of their papers we have counts for

collaborators
Showing 2015Show all

7 papers · 1 filter

math.CO2015

Treewidth of grid subsets

Eli Berger, Zdenek Dvorak, Sergey Norin

Let Q_n be the graph of n times n times n cube with all non-decreasing diagonals (including the facial ones) in its constituent unit cubes. Suppose that a subset S of V(Q_n) separa…

math.CO2015

Turán numbers of extensions

Sergey Norin, Liana Yepremyan

The extension of an -uniform hypergraph is obtained from it by adding for every pair of vertices of , which is not covered by an edge in , an extra edge containing thi…

math.CO2015

Erdős-Szekeres without induction

Sergey Norin, Yelena Yuditsky

Let be the minimal integer such that any set of points in the plane in general position contains points in convex position. The problem of estimating wa…

math.CO2015

The extremal function for disconnected minors

Endre Csóka, Irene Lo, Sergey Norin +2

For a graph let denote the supremum of taken over all non-null graphs not containing as a minor. We show that $$c(H) \leq \frac{|V(H)|+\mathrm{co…

math.CO2015

Strongly sublinear separators and polynomial expansion

Zdenek Dvorak, Sergey Norin

A result of Plotkin, Rao, and Smith implies that graphs with polynomial expansion have strongly sublinear separators. We prove a converse of this result showing that hereditary cla…

cs.GT2015★ 7 cited

Large Supports are required for Well-Supported Nash Equilibria

Yogesh Anbalagan, Hao Huang, Shachar Lovett +3

We prove that for any constant and any , there exist bimatrix win-lose games for which every -WSNE requires supports of cardinality greater than . To do this, we pro…

math.CO2015

Turán Number of Generalized Triangles

Sergey Norin, Liana Yepremyan

The family consists of all -graphs with three edges such that and . A generalized triangle, $\mathcal{T}…