11 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…
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…
Induced rational exponents and bipartite subgraphs in -free graphs
Zichao Dong, Jun Gao, Ruonan Li +1
In this paper, we study a general phenomenon that many extremal results for bipartite graphs can be transferred to the induced setting when the host graph is -free. As ma…
Set families: restricted distances via restricted intersections
Zichao Dong, Jun Gao, Hong Liu +2
Denote by the maximum size of a set family on with distance set . That is, holds for every pair of di…