Yuhao Zhao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yuhao Zhao has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Xiande Zhang
School of Mathematical Sciences, University of Science and Technology of China, Hefei, China
6 shared publications - Chong Shangguan
Research Center for Mathematics and Interdisciplinary Sciences, Shandong University, Qingdao, China
1 shared publication - Gennian Ge
Capital Normal University
1 shared publication - Xin Wei
School of Mathematical Sciences, University of Science and Technology of China, Hefei, China
1 shared publication - Xinqi Huang
School of Mathematical Sciences, University of Science and Technology of China, Hefei, Anhui 230026, China
1 shared publication
Latest Publications
- Top Cited Papers
- 25 February 2026
- Published by Springer Nature in Science China Mathematics
- p. 1-14
Counting cliques with prescribed intersection sizes
- 25 February 2026
- Published by Springer Nature in Science China Mathematics
- p. 1-14
Top Cited PapersCounting cliques with prescribed intersection sizes
- Open Access
Counting cliques with prescribed intersection sizes
We study the generalized Turán problem regarding cliques with restricted intersections, which highlights the motivation from extremal set theory. Let $L=\{\ell_1,\dots,\ell_s\}\subset [0,r-1]$ be a fixed integer set with $|L|\notin \{1,r\}$ and $\ell_1<\dots<\ell_s$, and let $Ψ_r(n,L)$ denote the maximum number of $r$-cliques in an $n$-vertex graph whose $r$-cliques are $L$-intersecting as a family of $r$-subsets. Helliar and Liu recently initiated the systematic study of the function $Ψ_r(n,L)$ and showed that $Ψ_r(n,L)\le \left(1-\frac{1}{3r}\right) \prod_{\ell\in L}\frac{n-\ell}{r-\ell}$ for large $n$, improving the trivial bound from the Deza--Erdős--Frankl theorem by a factor of $1-\frac{1}{3r}$. In this article, we improve their result by showing that as $n$ goes to infinity $Ψ_r(n,L)=Θ_{r,L}(n^{|L|})$ if and only if $\ell_1,\dots,\ell_s,r$ form an arithmetic progression and fully determining the corresponding exact values of $Ψ_r(n,L)$ for sufficiently large $n$ in this case. Moreover, when $L=[t,r-1]$, for the generalized Turán extension of the Erdős--Ko--Rado theorem given by Helliar and Liu, we show a Hilton--Milner-type stability result.Open AccessCounting cliques with prescribed intersection sizes
We study the generalized Turán problem regarding cliques with restricted intersections, which highlights the motivation from extremal set theory. Let $L=\{\ell_1,\dots,\ell_s\}\subset [0,r-1]$ be a fixed integer set with $|L|\notin \{1,r\}$ and $\ell_1<\dots<\ell_s$, and let $Ψ_r(n,L)$ denote the maximum number of $r$-cliques in an $n$-vertex graph whose $r$-cliques are $L$-intersecting as a family of $r$-subsets. Helliar and Liu recently initiated the systematic study of the function $Ψ_r(n,L)$ and showed that $Ψ_r(n,L)\le \left(1-\frac{1}{3r}\right) \prod_{\ell\in L}\frac{n-\ell}{r-\ell}$ for large $n$, improving the trivial bound from the Deza--Erdős--Frankl theorem by a factor of $1-\frac{1}{3r}$. In this article, we improve their result by showing that as $n$ goes to infinity $Ψ_r(n,L)=Θ_{r,L}(n^{|L|})$ if and only if $\ell_1,\dots,\ell_s,r$ form an arithmetic progression and fully determining the corresponding exact values of $Ψ_r(n,L)$ for sufficiently large $n$ in this case. Moreover, when $L=[t,r-1]$, for the generalized Turán extension of the Erdős--Ko--Rado theorem given by Helliar and Liu, we show a Hilton--Milner-type stability result. - Open Access
On low-power error-correcting cooling codes with large distances
A low-power error-correcting cooling (LPECC) code was introduced as a coding scheme for communication over a bus by Chee et al. to control the peak temperature, the average power consumption of on-chip buses, and error-correction for the transmitted information, simultaneously. Specifically, an $(n, t, w, e)$-LPECC code is a coding scheme over $n$ wires that avoids state transitions on the $t$ hottest wires and allows at most $w$ state transitions in each transmission, and can correct up to $e$ transmission errors. In this paper, we study the maximum possible size of an $(n, t, w, e)$-LPECC code, denoted by $C(n,t,w,e)$. When $w=e+2$ is large, we establish a general upper bound $C(n,t,w,w-2)\leq \lfloor \binom{n+1}{2}/\binom{w+t}{2}\rfloor$; when $w=e+2=3$, we prove $C(n,t,3,1) \leq \lfloor \frac{n(n+1)}{6(t+1)}\rfloor$. Both bounds are tight for large $n$ satisfying some divisibility conditions. Previously, tight bounds were known only for $w=e+2=3,4$ and $t\leq 2$. In general, when $w=e+d$ is large for a constant $d$, we determine the asymptotic value of $C(n,t,w,w-d)\sim \binom{n}{d}/\binom{w+t}{d}$ as $n$ goes to infinity, which can be extended to $q$-ary codes.Open AccessOn low-power error-correcting cooling codes with large distances
A low-power error-correcting cooling (LPECC) code was introduced as a coding scheme for communication over a bus by Chee et al. to control the peak temperature, the average power consumption of on-chip buses, and error-correction for the transmitted information, simultaneously. Specifically, an $(n, t, w, e)$-LPECC code is a coding scheme over $n$ wires that avoids state transitions on the $t$ hottest wires and allows at most $w$ state transitions in each transmission, and can correct up to $e$ transmission errors. In this paper, we study the maximum possible size of an $(n, t, w, e)$-LPECC code, denoted by $C(n,t,w,e)$. When $w=e+2$ is large, we establish a general upper bound $C(n,t,w,w-2)\leq \lfloor \binom{n+1}{2}/\binom{w+t}{2}\rfloor$; when $w=e+2=3$, we prove $C(n,t,3,1) \leq \lfloor \frac{n(n+1)}{6(t+1)}\rfloor$. Both bounds are tight for large $n$ satisfying some divisibility conditions. Previously, tight bounds were known only for $w=e+2=3,4$ and $t\leq 2$. In general, when $w=e+d$ is large for a constant $d$, we determine the asymptotic value of $C(n,t,w,w-d)\sim \binom{n}{d}/\binom{w+t}{d}$ as $n$ goes to infinity, which can be extended to $q$-ary codes. - Open Access
Focal-free uniform hypergraphs and codes
Motivated by the study of a variant of sunflowers, Alon and Holzman recently introduced focal-free hypergraphs. In this paper, we show that there is an interesting connection between the maximum size of focal-free hypergraphs and the renowned Erdős Matching Conjecture on the maximum number of edges that can be contained in a uniform hypergraph with bounded matching number. As a consequence, we give asymptotically optimal bounds on the maximum sizes of focal-free uniform hypergraphs and codes, thereby significantly improving the previous results of Alon and Holzman. Moreover, by using the existentce results of combinatorial designs and orthogonal arrays, we are able to explicitly determine the exact sizes of maximum focal-free uniform hypergraphs and codes for a wide range of parameters.
Open AccessFocal-free uniform hypergraphs and codes
Motivated by the study of a variant of sunflowers, Alon and Holzman recently introduced focal-free hypergraphs. In this paper, we show that there is an interesting connection between the maximum size of focal-free hypergraphs and the renowned Erdős Matching Conjecture on the maximum number of edges that can be contained in a uniform hypergraph with bounded matching number. As a consequence, we give asymptotically optimal bounds on the maximum sizes of focal-free uniform hypergraphs and codes, thereby significantly improving the previous results of Alon and Holzman. Moreover, by using the existentce results of combinatorial designs and orthogonal arrays, we are able to explicitly determine the exact sizes of maximum focal-free uniform hypergraphs and codes for a wide range of parameters.
- Open Access
Improved upper bounds for wide-sense frameproof codes
Frameproof codes have been extensively studied for many years due to their application in copyright protection and their connection to extremal set theory. In this paper, we investigate upper bounds on the cardinality of wide-sense $t$-frameproof codes. For $t=2$, we apply results from Sperner theory to give a better upper bound, which significantly improves a recent bound by Zhou and Zhou. For $t\geq 3$, we provide a general upper bound by establishing a relation between wide-sense frameproof codes and cover-free families. Finally, when the code length $n$ is at most $\frac{15+\sqrt{33}}{24}(t-1)^2$, we show that a wide-sense $t$-frameproof code has at most $n$ codewords, and the unique optimal code consists of all weight-one codewords. As byproducts, our results improve several best known results on binary $t$-frameproof codes.Open AccessImproved upper bounds for wide-sense frameproof codes
Frameproof codes have been extensively studied for many years due to their application in copyright protection and their connection to extremal set theory. In this paper, we investigate upper bounds on the cardinality of wide-sense $t$-frameproof codes. For $t=2$, we apply results from Sperner theory to give a better upper bound, which significantly improves a recent bound by Zhou and Zhou. For $t\geq 3$, we provide a general upper bound by establishing a relation between wide-sense frameproof codes and cover-free families. Finally, when the code length $n$ is at most $\frac{15+\sqrt{33}}{24}(t-1)^2$, we show that a wide-sense $t$-frameproof code has at most $n$ codewords, and the unique optimal code consists of all weight-one codewords. As byproducts, our results improve several best known results on binary $t$-frameproof codes. - Open Access
On supersaturation for oddtown and eventown
We study the supersaturation problems of oddtown and eventown. Given a family $\mathcal A$ of subsets of an $n$ element set, let $op(\mathcal A)$ denote the number of distinct pairs $A,B\in \mathcal A$ for which $|A \cap B|$ is odd. We show that if $\mathcal A$ consists of $n+s$ odd-sized subsets, then $op(\mathcal A)\geq s+2$, which is tight when $s\le n-4$. This disproves a conjecture by O'Neill on the supersaturation problem of oddtown. For the supersaturation problem of eventown, we show that for large enough $n$, if $\mathcal A$ consists of $2^{\lfloor \frac n 2\rfloor}+s$ even-sized subsets, then $op(\mathcal A)\ge s\cdot2^{\lfloor \frac n 2\rfloor-1} $ for any positive integer $s\le \frac{2^{\lfloor\frac n 8\rfloor}} n$. This partially proves a conjecture by O'Neill on the supersaturation problem of eventown. Previously, the correctness of this conjecture was only verified for $s=1$ and $2$. We further provide a twice weaker lower bound in this conjecture for eventown, that is $op(\mathcal{A})\ge s\cdot 2^{\lfloor n/2\rfloor-2}$ for general $n$ and $s$ by using discrete Fourier analysis. Finally, some asymptotic results for the lower bounds of $op(\mathcal A)$ are given when $s$ is large for both problems.Open AccessOn supersaturation for oddtown and eventown
We study the supersaturation problems of oddtown and eventown. Given a family $\mathcal A$ of subsets of an $n$ element set, let $op(\mathcal A)$ denote the number of distinct pairs $A,B\in \mathcal A$ for which $|A \cap B|$ is odd. We show that if $\mathcal A$ consists of $n+s$ odd-sized subsets, then $op(\mathcal A)\geq s+2$, which is tight when $s\le n-4$. This disproves a conjecture by O'Neill on the supersaturation problem of oddtown. For the supersaturation problem of eventown, we show that for large enough $n$, if $\mathcal A$ consists of $2^{\lfloor \frac n 2\rfloor}+s$ even-sized subsets, then $op(\mathcal A)\ge s\cdot2^{\lfloor \frac n 2\rfloor-1} $ for any positive integer $s\le \frac{2^{\lfloor\frac n 8\rfloor}} n$. This partially proves a conjecture by O'Neill on the supersaturation problem of eventown. Previously, the correctness of this conjecture was only verified for $s=1$ and $2$. We further provide a twice weaker lower bound in this conjecture for eventown, that is $op(\mathcal{A})\ge s\cdot 2^{\lfloor n/2\rfloor-2}$ for general $n$ and $s$ by using discrete Fourier analysis. Finally, some asymptotic results for the lower bounds of $op(\mathcal A)$ are given when $s$ is large for both problems.