1 citations · 1 across the 11 of their papers we have counts for
5 papers · 1 filter
An improved bound on the minimum size of Turán -systems
Jun Gao, Peiru Kuang, Oleg Pikhurko +1
For positive integers , let denote the minimum number of edges in an -uniform hypergraph on vertices such that every -set of vertices contains at lea…
The inducibility of 6-vertex graphs
Levente Bodnár, Jun Gao, Jared León +3
The inducibility constant of a graph is the asymptotically maximum induced density of in a growing sequence of graphs. This paper systematically investigates the ca…
Strong non-principality of positive codegree Turán density
Levente Bodnár, Jun Gao, Oleg Pikhurko +2
The \emph{minimum positive codegree} of a -graph is the minimum, over all -sets that lie in at least one edge, of the number of edges containing that s…
Beyond Averaging in John Ellipsoid Approximation: High-Accuracy Algorithms in the Leverage-Score Model
Xiaoyu Li, Junwei Yu, Jiaojiao Jiang +2
The John ellipsoid of a symmetric polytope , , is computed by a long line…
A note on the Ratio and Inertia Bounds for the -Independence Number
Jun Gao, Jie Ma, Oleg Pikhurko
The -th power of a graph is the graph on the same vertex set where the edge set consists of those pairs of distinct vertices of that are at distance at most fr…