SearcharxivSearch

arXiv subjects

Shujing Miao

Publications and source records attributed to Shujing Miao.

4 recordsLinked to original sources

On the Tur\'an number of blow-ups of $\mathcal{F}_5$

Let $\mathcal{F}_5$ denote the $3$-uniform hypergraph on the vertex set $\{f_1,f_2,\dots,f_5\}$ with hyperedges $\{f_1f_2f_3,f_1f_2f_4,f_3f_4f_5\}$. Recently, Balogh, Clemen and Luo determined the Tur\'an number of a one-vertex blow-up of $\mathcal{F}_5$, more specifically, they blow up the vertex $f_5$ to $t$ vertices, the resulting hypergraph is denoted by $\mathcal{F}_5(f_5;t)$. They show that for infinitely many $t$, $\mathcal{F}_5(f_5;t)$ has exponentially many extremal constructions and positive Tur\'an density. In this paper, we determine the exact Tur\'an number of the hypergraph obtained by blowing up $f_3$ of $\mathcal{F}_5$ to $t$ vertices and show that it also has exponentially many extremal constructions. We also give a general upper bound and lower bound of the Tur\'an number of every blow-up of $\mathcal{F}_5$. For some special blow-ups of $\mathcal{F}_5$, for example, $t$-disjoint copies of $\mathcal{F}_5$, we determine the exact Tur\'an number. We construct a hypergraph $\mathcal{F}_{sim}(t)$ which is a subgraph of a blow-up of $\mathcal{F}_5$, and is contained in the hypergraph obtained by adding any new hyperedge to the Tur\'an hypergraph (the balanced complete $3$-partite hypergraph), but its extremal construction is not the Tur\'an hypergraph. We also determine the exact Tur\'an number of $\mathcal{F}_{sim}(t)$.

math.CO

The Tur\'{a}n number of Berge paths

A Berge path of length $k$ in an $r$-uniform hypergraph is a collection of $k$ hyperedges $h_1,\dots,h_k$ and $k+1$ vertices $v_1,\dots,v_{k+1}$ such that $v_i, v_{i+1}\in h_i$ for each $1\le i\le k$. Gy\H{o}ri, Katona and Lemons [\textit{European J. Combin. 58 (2016) 238--246}] generalized the Erd\H{o}s-Gallai theorem to Berge paths and established bounds for the Tur\'{a}n number of Berge paths. However, these bounds are sharp only when some divisibility conditions hold. Gy\H ori, Lemons, Salia and Zamora [\textit{J. Combin. Theory Ser. B 148 (2021) 239--250}] determined the exact value of the Tur\'{a}n number of Berge paths in the case $k\le r$. In this paper, we settle the final open case $k>r$, thereby completing the determination of the Tur\'{a}n number of Berge paths.

math.CO

Rainbow Turán problems for a matching and any other graph

For a family of graphs $\cF$, a graph is called $\cF$-free if it does not contain any member of $\cF$ as a subgraph. Given a collection of graphs $(G_1,\ldots,G_t)$ on the same vertex set $V$ of size $n$, a rainbow graph on $V$ is obtained by taking at most one edge from each $G_i$. We say that a collection is rainbow $\cF$-free if it contains no rainbow copy of any member of $\cF$. In this paper, we study the maximum values of $min_{i\in [t]}|E(G_i)|$, $\sum_{i=1}^{t}|E(G_i)|$ and $\prod_{i=1}^{t}|E(G_i)|$ among rainbow $\{F,M_{s+1}\}$-free collections $(G_1,\ldots,G_t)$ on $n$ vertices.

math.CO

Matching extension and matching exclusion via the size or the spectral radius of graphs

A graph $G$ is said to be $k$-extendable if every matching of size $k$ in $G$ can be extended to a perfect matching of $G$, where $k$ is a positive integer. We say $G$ is $1$-excludable if for every edge $e$ of $G$, there exists a perfect matching excluding $e$. In this paper, we first establish a lower bound on the size (resp. the spectral radius) of $G$ to guarantee that $G$ is $k$-extendable. Then we determine a lower bound on the size (resp. the spectral radius) of $G$ to guarantee that $G$ is $1$-excludable. All the corresponding extremal graphs are characterized.

math.CO