Searcharxiv⌕ Search

arXiv subjects

Lusheng Fang

Publications and source records attributed to Lusheng Fang.

3 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↗

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↗