9 papers
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 c…
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…
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…
Counting cliques without generalized theta graphs
Jun Gao, Zhuo Wu, Yisai Xue
The \textit{generalized Turán number} is the maximum possible number of copies of in an -free graph on vertices for any two graphs and . F…
Set families: restricted distances via restricted intersections
Zichao Dong, Jun Gao, Hong Liu +2
Denote by the maximum size of a set family on $[n] \stackrel{\mbox{\normalfont\tiny def}}{=} \{1, \dots, n\}$ with distance set . That is, $|A \bigtriangl…