Searcharxiv⌕ Search

arXiv subjects

Guorong Gao

Publications and source records attributed to Guorong Gao.

12 recordsLinked to original sources

Independent sets in regular uniform hypergraphs

We prove that, for all integers $r\ge 2$ and $d\ge 1$, every finite simple $d$-regular $r$-uniform hypergraph $H$ on $n$ vertices satisfies \[ \operatorname{ind}(H)\le \operatorname{ind}(H_d^r)^{n/(rd)}, \] with equality if and only if $H$ is a disjoint union of copies of $H_d^r$. Here $\operatorname{ind}(G)$ denotes the number of independent sets in $G$, and $ H_d^r$ is the $d$-regular $r$-partite $r$-graph on $rd$ vertices obtained by taking all $r$-sets consisting of one vertex from a fixed $d$-vertex set and one of $d$ pairwise disjoint $(r-1)$-sets partitioning the remaining vertices. This settles the conjecture of Balogh, Bollobás and Narayanan, who proved the bound for quasi-bipartite hypergraphs.

math.CO↗

Spectral Turán problems for complete bipartite expansions in linear hypergraphs

An $r$-uniform hypergraph is linear if any two edges share at most one vertex. For a family $\mathcal F$ of $r$-graphs, let $\text{ex}^{\text{lin}}_r(n,\mathcal F)$ and $\text{spex}^{\text{lin}}_r(n,\mathcal F)$ denote, respectively, the maximum number of edges and the maximum spectral radius of an $n$-vertex $\mathcal F$-free linear $r$-graph. In this paper, we show that for $t\ge s\ge3$, $\text{spex}^{\text{lin}}_r(n,K_{s,t}^{+})\le \frac{(t-s+1)^{1/s}}{r-1}n^{1-1/s}+o(n^{1-1/s})$, where $K_{s,t}^{+}$ is the $r$-graph obtained from the complete bipartite graph $K_{s,t}$ by enlarging each edge with $r-2$ new vertices. This answers a problem of She, Fan and Kang in a stronger form. Moreover, our result implies that $\text{ex}^\text{lin}_r(n,K_{s,t}^{+}) \le \frac{(t-s+1)^{1/s}}{r(r-1)}n^{2-1/s}+o(n^{2-1/s})$, which improves the leading coefficient in the corresponding bound of Gao and Chang. We also give a construction which implies that $\text{spex}^{\text{lin}}_r(n,K_{s,t}^{+})=Θ(n^{1-1/s})$ and $\text{ex}^\text{lin}_r(n,K_{s,t}^{+})=Θ(n^{2-1/s})$ for $s\ge 4r-6$ and $t>(s-1)!$.

math.CO↗

Sharp bounds for Duke--Erdős--Rödl problems on cycle-connected subgraphs

For $k\ge2$, a graph is $C_{2k}$-connected if every two distinct edges lie together on an even cycle of length at most $2k$ in that graph. Let $f_k(n,m)$ be the largest number of edges in a $C_{2k}$-connected subgraph that every $n$-vertex graph with $m$ edges must contain. In this paper, we study two cycle-connected problems raised by Duke, Erdős and Rödl. First, Duke, Erdős and Rödl showed that $f_3(n,\lfloor n^{2-β}\rfloor)=Θ(n^{2-3β})$ for every fixed $0< β<1/2$ and ask for the case of $β\ge 1/2$. We solve this problem in a stronger form by determining that the optimal range of $β$ is $(0,2/3]$. Second, we prove that $f_2(n,\binom n2-s)=(1/(2e)+o(1))n^3/s$ whenever $\frac{s}{n}\to\infty$ and $s=o(n^2)$, determining the leading constant in an estimate of Duke, Erdős, and Rödl. The first result uses a finite-field construction and a count of three-edge paths. The second uses the known structure of $C_4$-connected graphs and estimates for complete bipartite subgraphs in a random graph.

math.CO↗

On Non-Uniform Baranyai Factorizations

For a fixed nonempty finite set $L$ of positive integers and $k=\max L\ge2$, let $\binom{[n]}{L}=\bigcup_{\ell\in L}\binom{[n]}{\ell}$ denote the non-uniform hypergraph whose edge set consists of all $\ell$-subsets of $[n]$ for $\ell\in L$. A $1$-factor of a hypergraph $H$ is a collection of pairwise disjoint edges whose union is $V(H)$. We say $H$ is $1$-factorable if $E(H)$ can be partitioned into $1$-factors. In this paper, we study the 1-factorability of $\binom{[n]}{L}$. Earlier work of He, Huang, and Ma shows that, for all sufficiently large $n$, $1$-factorability can occur only in the residue classes $0$ and $-1$ modulo $k$: it always occurs in class $0$, whereas it occurs in class $-1$ only if $k-1\in L$. We determine exactly when $1$-factorability occurs in this exceptional class. More precisely, we define a finite gcd-peeling algorithm on $L\setminus\{k-1,k\}$ and prove that $\binom{[qk-1]}{L}$ is $1$-factorable if and only if the algorithm accepts. As a consequence, our result provides a criterion for the $1$-factorability of $\binom{[n]}{L}$ and confirms the conjecture posed by He, Huang, and Ma.

math.CO↗

Sparse Approximate Chromatic Profiles of Triangle-Free Graphs

We prove a sparse version of the four-colour theorem of Brandt and Thomassé, answering a question of Allen, Böttcher, Kohayakawa and Roberts. For every fixed $0<γ\le1/10$ and every $p=p(n)\in(0,1]$, asymptotically almost surely every spanning triangle-free $H\subseteq G(n,p)$ with $δ(H)\ge(1/3+γ)pn$ can be made four-partite by deleting at most $\min\{C_γn/p,(1/8+γ)pn^2\}$ edges. In fact, deleting at most $C_γn/p$ edges yields a graph that admits a homomorphism to an Andrásfai or Vega graph with certificate complexity at most $1/(3γ)$. Together with matching lower bounds from random blow-ups, this structural result determines, uniformly in $p$, the minimum-degree thresholds for $q$-partiteness with $O(n/p)$ edge deletions: $2/5$ for $q=2$, $10/29$ for $q=3$, and $1/3$ for every fixed $q\ge4$. For every fixed $q\ge2$ and $\log n/n\ll p\ll n^{-1/2}$, asymptotically almost surely $G(n,p)$ contains a spanning triangle-free subgraph with minimum degree $(1-o(1))pn$ that requires $(1/(2q)+o(1))pn^2$ edge deletions to become $q$-partite, showing that the coefficient $1/(2q)$ cannot be improved even under this stronger degree condition.

math.CO↗

Tight bound for the skew Hamming set-pair problem

Let $X$ be an alphabet, let $t\geq 0$ and $n\geq t+1$, and let $((a_i,b_i))_{i=1}^{m}$ be an ordered family of word pairs in $X^n$ satisfying $dist(a_i,b_i)\geq t+1$ for every $i$ and $dist(a_i,b_j)\leq t$ whenever $i<j$. We prove the sharp bound $m\leq 2^{t+1}$, thereby resolving a problem posed by Alon, Jin, and Sudakov. Our proof uses a linear-algebraic method based on a characteristic-two algebra, which may be of independent interest.

math.CO↗

Spectral Radius Conditions for 3-Uniform Intersecting Families

Let $M_k$ denote a matching of size $k$. The classical Erdős matching conjecture asks for the maximum number of edges of an intersecting $r$-graph without $M_k$. The csae for $k=2$, which is known as intersecting $r$-graph, is established by Erdős, Ko and Rado. Hilton and Milner further determine the maximum number of edges of a non-trivial intersecting $r$-graph, where the intersecting $r$-graph $H$ is called non-trivial if $\cap_{e\in E(H)}e=\emptyset$. In this paper, we investigate the spectral analogues of the hpergraph matching problems and intersecting family problems. More precisely, for sufficiently large $n$, we determine respectively the maximum spectral radius of $M_{k+1}$-free and non-trivial intersecting $3$-graphs on $n$ vertices, and characterize the extremal hypergraphs.

math.CO↗

On saturation problems involving clique number and matching number

For a clique $K_r$, a graph is $K_r$-saturated if it contains no copy of $K_r$ and the addition of any edge from its complement creates a $K_r$. A classical result of Erdős-Hajnal-Moon and Zykov shows that the number of edges of an $n$-vertex $K_r$-saturated graph is at least $(r-2)n-\binom{r-1}{2}$. In this paper, we focus on the number of edges of the $K_r$-saturated graphs with a fixed matching number. Let $G$ be an $n$-vertex $K_r$-saturated graph with matching number $ν(G) = s$. For sufficiently large $n$, we prove that the number of edges \begin{equation*} e(G)\geq \left\{\begin{array}{cl}{(r-1)n-\frac{r}{2}(r-1)-1,}&{\quad\mathrm{if}~s=r-1;}\\{(r-1)n + (s-r)^2 - \frac{1}{2}(r+2)(r-3) - 5,}&{\quad\mathrm{if}~s>r-1.}\\\end{array}\right. \end{equation*} Moreover, we completely characterize the graphs attaining the equality.

math.CO↗

Tight bounds towards Zarankiewicz problem in hypergraph

The classical Zarankiewicz problem, which concerns the maximum number of edges in a bipartite graph without a forbidden complete bipartite subgraph, motivates a direct analogue for hypergraphs. Let $K_{s_1,\ldots, s_r}$ be the complete $r$-partite $r$-graph such that the $i$-th part has $s_i$ vertices. We say an $r$-partite $r$-graph $H=H(V_1,\ldots,V_r)$ contains an ordered $K_{s_1,\ldots, s_r}$ if $K_{s_1,\ldots, s_r}$ is a subgraph of $H$ and the set of size $s_i$ vertices is embedded in $V_i$. The Zarankiewicz number for $r$-graph, denoted by $z(m_1, \ldots, m_{r}; s_1,, \ldots,s_{r})$, is the maximum number of edges of the $r$-partite $r$-graph whose $i$-th part has $m_i$ vertices and does not contain an ordered $K_{s_1,\ldots, s_r}$. In this paper, we show that $$z(m_1,m_2, \cdots, m_{r-1},n ; s_1,s_2, \cdots,s_{r-1}, t)=Θ\left(m_1m_2\cdots m_{r-1} n^{1-1 / s_1s_2\cdots s_{r-1}}\right)$$ for a range of parameters. This extends a result of Conlon [Math. Proc. Camb. Philos. Soc. (2022)].

math.CO↗

Variants of VC dimension and their applications to dynamics

Since its introduction by Vapnik and Chervonenkis in the 1960s, the VC dimension and its variants have played a central role in numerous fields. In this paper, we investigate several variants of the VC dimension and their applications to dynamical systems. First, we prove a new bound for a recently introduced generalization of VC dimension, which unifies and extends various extremal results on the VC, Natarajan, and Steele dimensions. This new bound allows us to strengthen one of the main theorems of Huang and Ye [Adv. Math., 2009] in dynamical systems. Second, we refine a key lemma of Huang and Ye related to a variant of VC dimension by providing a more concise and conceptual proof. We also highlight a surprising connection among this result, combinatorics, dynamical systems, and recent advances in communication complexity.

math.CO↗

Almost regular subgraphs under spectral radius constrains

A graph is called $K$-almost regular if its maximum degree is at most $K$ times the minimum degree. Erdős and Simonovits showed that for a constant $0< \varepsilon< 1$ and a sufficiently large integer $n$, any $n$-vertex graph with more than $n^{1+\varepsilon}$ edges has a $K$-almost regular subgraph with $n'\geq n^{\varepsilon\frac{1-\varepsilon}{1+\varepsilon}}$ vertices and at least $\frac{2}{5}n'^{1+\varepsilon}$ edges. An interesting and natural problem is whether there exits the spectral counterpart to Erdős and Simonovits's result. In this paper, we will completely settle this issue. More precisely, we verify that for constants $\frac{1}{2}<\varepsilon\leq 1$ and $c>0$, if the spectral radius of an $n$-vertex graph $G$ is at least $cn^{\varepsilon}$, then $G$ has a $K$-almost regular subgraph of order $n'\geq n^{\frac{2\varepsilon^2-\varepsilon}{24}}$ with at least $ c'n'^{1+\varepsilon}$ edges, where $c'$ and $K$ are constants depending on $c$ and $\varepsilon$. Moreover, for $0<\varepsilon\leq\frac{1}{2}$, there exist $n$-vertex graphs with spectral radius at least $cn^{\varepsilon}$ that do not contain such an almost regular subgraph. Our result has a wide range of applications in spectral Turán-type problems. Specifically, let $ex(n,\mathcal{H})$ and $spex(n,\mathcal{H})$ denote, respectively, the maximum number of edges and the maximum spectral radius among all $n$-vertex $\mathcal{H}$-free graphs. We show that for $1\geqξ> \frac{1}{2}$, $ex(n,\mathcal{H}) = O(n^{1+ξ})$ if and only if $spex(n,\mathcal{H}) = O(n^ξ)$.

math.CO↗

On local Turán density problems of hypergraphs

For integers $q\ge p\ge r\ge2$, we say that an $r$-uniform hypergraph $H$ has property $(q,p)$, if for any $q$-vertex subset $Q$ of $V(H)$, there exists a $p$-vertex subset $P$ of $Q$ spanning a clique in $H$. Let $T_{r}(n,q,p)=\min\{ e(H): H\subset \binom{[n]}{r}, H \text{~has property~} (q,p)\}$. The local Turán density about property $(q,p)$ in $r$-uniform hypergraphs is defined as $t_{r}(q,p)=\lim_{n\to \infty}T_{r}(n,q,p)/\binom{n}{r}$. Frankl, Huang and Rödl [J. Comb. Theory, Ser. A, 177 (2021)] showed that $\lim_{p\to\infty}t_{r}(ap+1,p+1)=\frac{1}{a^{r-1}}$ for positive integer $a$ and $t_{3}(2p+1,p+1)=\frac{1}{4}$ for all $p\ge 3$ and asked the question that determining the value of $\lim_{p\to\infty}t_{r}(γp+1,p+1)$, where $γ\ge 1$ is a real number. Based on the study of hypergraph Turán densities, we determine some exact values of local Turán densities and answer their question partially; in particular, our results imply that the equality in their question about exact values does not hold in general.

math.CO↗