Search

Let $\mathcal{S}_n$ be the symmetric group on the set $[n]:=\{1,2,\ldots,n\}$. A family $\mathcal{F}\subset \mathcal{S}_n$ is called intersecting if for every $\sigma,\pi\in \mathcal{F}$ there exists some $i\in [n]$ such that $\sigma(i)=\pi(i)$. Deza and Frankl proved that the largest intersecting family of permutations is the full star, that is, the collection of all permutations with a fixed position. The diversity of an intersecting family $\mathcal{F}$ is defined as the minimum number of permutations in $\mathcal{F}$, which deletion results in a star. In the present paper, by applying the spread approximation method developed recently by Kupavskii and Zakharov, we prove that for $n\geq 500$ the diversity of an intersecting subfamily of $\mathcal{S}_n$ is at most $(n-3)(n-3)!$, which is best possible., Comment: 8 pages, comments are welcome

Let $m\geq 2$, $n$ be positive integers, and $R_i=\{k_{i,1} >k_{i,2} >\cdots> k_{i,t_i}\}$ be subsets of $[n]$ for $i=1,2,\ldots,m$. The families $\mathcal{F}_1\subseteq \binom{[n]}{R_1},\mathcal{F}_2\subseteq \binom{[n]}{R_2},\ldots,\mathcal{F}_m\subseteq \binom{[n]}{R_m}$ are said to be non-empty cross-intersecting if for each $i\in [m]$, $\mathcal{F}_i\neq\emptyset$ and for any $A\in \mathcal{F}_i,B\in\mathcal{F}_j$, $1\leq i

An edge-colored graph is called rainbow if all the colors on its edges are distinct. Given a positive integer n and a graph G, the anti-Ramsey number ar(n,G) is the maximum number of colors in an edge-coloring of K_{n} with no rainbow copy of G. Denote by kC_{3} the union of k vertex-disjoint copies of C_{3}. In this paper, we determine the anti-Ramsey number ar(n,kC_{3}) for n=3k and n\geq2k^{2}-k+2, respectively. When 3k\leq n\leq 2k^{2}-k+2, we give lower and upper bounds for ar(n, kC_{3}).

We call a $4$-cycle in $K_{n_{1}, n_{2}, n_{3}}$ multipartite, denoted by $C_{4}^{\text{multi}}$, if it contains at least one vertex in each part of $K_{n_{1}, n_{2}, n_{3}}$. The Tur\'an number $\text{ex}(K_{n_{1},n_{2},n_{3}}, C_{4}^{\text{multi}})$ $\bigg($ respectively, $\text{ex}(K_{n_{1},n_{2},n_{3}},\{C_{3}, C_{4}^{\text{multi}}\})$ $\bigg)$ is the maximum number of edges in a graph $G\subseteq K_{n_{1},n_{2},n_{3}}$ such that $G$ contains no $C_{4}^{\text{multi}}$ $\bigg($ respectively, $G$ contains neither $C_{3}$ nor $C_{4}^{\text{multi}}$ $\bigg)$. We call a $C^{multi}_4$ rainbow if all four edges of it have different colors. The ant-Ramsey number $\text{ar}(K_{n_{1},n_{2},n_{3}}, C_{4}^{\text{multi}})$ is the maximum number of colors in an edge-colored of $K_{n_{1},n_{2},n_{3}}$ with no rainbow $C_{4}^{\text{multi}}$. In this paper, we determine that $\text{ex}(K_{n_{1},n_{2},n_{3}}, C_{4}^{\text{multi}})=n_{1}n_{2}+2n_{3}$ and $\text{ar}(K_{n_{1},n_{2},n_{3}}, C_{4}^{\text{multi}})=\text{ex}(K_{n_{1},n_{2},n_{3}}, \{C_{3}, C_{4}^{\text{multi}}\})+1=n_{1}n_{2}+n_{3}+1,$ where $n_{1}\ge n_{2}\ge n_{3}\ge 1.$

A subgraph of an edge-colored graph is rainbow, if all of its edges have different colors. For a graph $G$ and a family $\mathcal{H}$ of graphs, the anti-Ramsey number $ar(G, \mathcal{H})$ is the maximum number $k$ such that there exists an edge-coloring of $G$ with exactly $k$ colors without rainbow copy of any graph in $\mathcal{H}$. In this paper, we study the anti-Ramsey number of $C_{3}$ and $C_{4}$ in the complete $r$-partite graphs. For $r\ge 3$ and $n_{1}\ge n_{2}\ge \cdots\ge n_{r}\ge 1$, we determine $ ar(K_{n_{1}, n_{2}, \ldots, n_{r}},\{C_{3}, C_{4}\}), ar(K_{n_{1}, n_{2}, \ldots, n_{r}}, C_{3})$ and $ar(K_{n_{1}, n_{2}, \ldots, n_{r}}, C_{4})$., Comment: 12 pages

Suppose $k \ge 2$ is an integer. Let $Y_k$ be the poset with elements $x_1, x_2, y_1, y_2, \ldots, y_{k-1}$ such that $y_1 < y_2 < \cdots < y_{k-1} < x_1, x_2$ and let $Y_k'$ be the same poset but all relations reversed. We say that a family of subsets of $[n]$ contains a copy of $Y_k$ on consecutive levels if it contains $k+1$ subsets $F_1, F_2, G_1, G_2, \ldots, G_{k-1}$ such that $G_1\subset G_2 \subset \cdots \subset G_{k-1} \subset F_1, F_2$ and $|F_1| = |F_2| = |G_{k-1}|+1 =|G_{k-2}|+ 2= \cdots = |G_{1}|+k-1$. If both $Y_k$ and $Y'_k$ on consecutive levels are forbidden, the size of the largest such family is denoted by $\mathrm{La}_{\mathrm{c}}(n, Y_k, Y'_k)$. In this paper, we will determine the exact value of $\mathrm{La}_{\mathrm{c}}(n, Y_k, Y'_k)$.

The Tur\'an number of a graph H, ex(n,H), is the maximum number of edges in a graph on n vertices which does not have H as a subgraph. Let P_k be the path with k vertices, the square P^2_k of P_k is obtained by joining the pairs of vertices with distance one or two in P_k. The powerful theorem of Erd\H{o}s, Stone and Simonovits determines the asymptotic behavior of ex(n,P^2_k). In the present paper, we determine the exact value of ex(n,P^2_5) and ex(n,P^2_6) and pose a conjecture for the exact value of ex(n,P^2_k).

Let $pr(K_{n}, G)$ be the maximum number of colors in an edge-coloring of $K_{n}$ with no properly colored copy of $G$. In this paper, we show that $pr(K_{n}, G)-ex(n, \mathcal{G'})=o(n^{2}), $ where $\mathcal{G'}=\{G-M: M \text{ is a matching of }G\}$. Furthermore, we determine the value of $pr(K_{n}, P_{l})$ for $l\ge 27$ and $n\ge 2l^{3}$ and the exact value of $pr(K_{n}, G)$, where $G$ is $C_{5}, C_{6}$ and $K_{4}^{-}$, respectively. Also, we give an upper bound and a lower bound of $pr(K_{n}, K_{2,3})$., Comment: 17 pages

We call a subgraph of an edge-colored graph rainbow subgraph, if all of its edges have different colors. The anti-Ramsey number of a graph $G$ in a complete graph $K_{n}$, denoted by $ar(K_{n}, G)$, is the maximum number of colors in an edge-coloring of $K_{n}$ with no rainbow subgraph copy of $G$. In this paper, we determine the exact value of the anti-Ramsey number for star forests and the approximate value of the anti-Ramsey number for linear forests. Furthermore, we compute the exact value of $ar(K_{n}, 2P_{4})$ for $n\ge 8$ and $ar(K_{n}, S_{p,q})$ for large $n$, where $S_{p,q}$ is the double star with $p+q$ leaves., Comment: 18 pages, 1 figure

In this note, we determine the maximum size of a $\{V_{k}, \Lambda_{l}\}$-free family in the lattice of vector subspaces of a finite vector space both in the non-induced case as well as the induced case, for a large range of parameters $k$ and $l$. These results generalize earlier work by Shahriari and Yu. We also prove a general LYM-type lemma for the linear lattice which resolves a conjecture of Shahriari and Yu., Comment: Updated to include suggestions of the referee

In this paper, we provide a common generalization to the well-known Erd\H{o}s-Ko-Rado Theorem, Frankl-Wilson Theorem, Alon-Babai-Suzuki Theorem, and Snevily Theorem on set systems with $\mathcal{L}$-intersections. As a consequence, we derive a result which strengthens substantially the well-known theorem on set systems with $k$-wise $\mathcal{L}$-intersections by F$\ddot{u}$redi and Sudakov [J. Combin. Theory, Ser. A (2004) 105: 143-159]. We will also derive similar results on $\mathcal{L}$-intersecting families of subspaces of an $n$-dimensional vector space over a finite field $\mathbb{F}_{q}$, where $q$ is a prime power.