Jun Gao

activity

20232026

most citedBipartite Turán problems via graph gluing

1 citations · 1 across the 11 of their papers we have counts for

collaborators

12 papers

math.CO2026

An improved bound on the minimum size of Turán $(r + 1, r)$ -systems

Jun Gao, Peiru Kuang, Oleg Pikhurko +1

For positive integers $n \geq s > r$ , let $T (n, s, r)$ denote the minimum number of edges in an $r$ -uniform hypergraph on $n$ vertices such that every $s$ -set of vertices contains at lea…

math.CO2026

The inducibility of 6-vertex graphs

Levente Bodnár, Jun Gao, Jared León +3

The inducibility constant $λ_{F}$ of a graph $F$ is the asymptotically maximum induced density of $F$ in a growing sequence of graphs. This paper systematically investigates the ca…

math.CO2026

Strong non-principality of positive codegree Turán density

Levente Bodnár, Jun Gao, Oleg Pikhurko +2

The \emph{minimum positive codegree} $δ_{k - 1}^{+} (G)$ of a $k$ -graph $G$ is the minimum, over all $(k - 1)$ -sets that lie in at least one edge, of the number of edges containing that s…

math.OC2026

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 $P = {x \in R^{d} : ∥ Ax ∥_{\infty} \leq 1}$ , $A \in R^{n \times d}$ , is computed by a long line…

math.CO2026

A note on the Ratio and Inertia Bounds for the $k$ -Independence Number

Jun Gao, Jie Ma, Oleg Pikhurko

The $k$ -th power $G^{k}$ of a graph $G$ is the graph on the same vertex set where the edge set consists of those pairs of distinct vertices of $G$ that are at distance at most $k$ fr…

math.CO2025

Induced rational exponents and bipartite subgraphs in $K_{s, s}$ -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 $K_{s, s}$ -free. As ma…

math.CO2025

Set families: restricted distances via restricted intersections

Zichao Dong, Jun Gao, Hong Liu +2

Denote by $f_{D} (n)$ the maximum size of a set family $F$ on $[n] = {1, \dots, n}$ with distance set $D$ . That is, $∣ A △ B ∣ \in D$ holds for every pair of di…

math.CO2025★ 1 cited

Bipartite Turán problems via graph gluing

Zichao Dong, Jun Gao, Hong Liu

For graphs $H_{1}$ and $H_{2}$ , if we glue them by identifying a given pair of vertices $u \in V (H_{1})$ and $v \in V (H_{2})$ , what is the extremal number of the resulting graph $H_1^u \od…

math.CO2024

Induced even cycles in locally sparse graphs

Laihao Ding, Jun Gao, Hong Liu +2

A graph $G$ is $(c, t)$ -sparse if for every pair of vertex subsets $A, B \subset V (G)$ with $∣ A ∣, ∣ B ∣ \geq t$ , $e (A, B) \leq (1 - c) ∣ A ∣∣ B ∣$ . In this paper we prove that for every $c > 0$ and…

math.CO2024

Phase transition of degenerate Turán problems in $p$ -norms

Jun Gao, Xizhi Liu, Jie Ma +1

For a positive real number $p$ , the $p$ -norm $∥ G ∥_{p}$ of a graph $G$ is the sum of the $p$ -th powers of all vertex degrees. We study the maximum $p$ -norm $\ma…

math.CO2024

Generalized Ramsey--Turán density for cliques

Jun Gao, Suyun Jiang, Hong Liu +1

We study the generalized Ramsey--Turán function $RT (n, K_{s}, K_{t}, o (n))$ , which is the maximum possible number of copies of $K_{s}$ in an $n$ -vertex $K_{t}$ -free graph with indepe…

math.CO2023

Counting cliques without generalized theta graphs

Jun Gao, Zhuo Wu, Yisai Xue

The \textit{generalized Turán number} $ex (n, T, F)$ is the maximum possible number of copies of $T$ in an $F$ -free graph on $n$ vertices for any two graphs $T$ and $F$ . Fo…

An improved bound on the minimum size of Turán (r+1,r)-systems

The inducibility of 6-vertex graphs

Strong non-principality of positive codegree Turán density

Beyond Averaging in John Ellipsoid Approximation: High-Accuracy Algorithms in the Leverage-Score Model

A note on the Ratio and Inertia Bounds for the k-Independence Number

Induced rational exponents and bipartite subgraphs in Ks,s​-free graphs

Set families: restricted distances via restricted intersections

Bipartite Turán problems via graph gluing

Induced even cycles in locally sparse graphs

Phase transition of degenerate Turán problems in p-norms

Generalized Ramsey--Turán density for cliques

Counting cliques without generalized theta graphs

An improved bound on the minimum size of Turán $(r + 1, r)$ -systems

A note on the Ratio and Inertia Bounds for the $k$ -Independence Number

Induced rational exponents and bipartite subgraphs in $K_{s, s}$ -free graphs

Phase transition of degenerate Turán problems in $p$ -norms