The Ramsey number of generalized loose paths in uniform Hypergrpahs

Let $H=(V,E)$ be an $r$-uniform hypergraph. For each $1 \leq s \leq r-1$, an $s$-path ${\mathcal P}^{r,s}_n$ of length $n$ in $H$ is a sequence of distinct vertices $v_1,v_2,\ldots,v_{s+n(r-s)}$ such that $\{v_{1+i(r-s)},\ldots, v_{s+(i+1)(r-s)}\}\in E(H)$ for each $0 \leq i \leq n-1$.Recently, the Ramsey number of $1$-paths in uniform hypergraphs has received a lot of attention. In this paper, we consider the Ramsey number of $r/2-$paths for even $r$. Namely, we prove the following exact result: $R({\mathcal P}^{r,r/2}_n,{\mathcal P}^{r,r/2}_3)=R({\mathcal P}^{r,r/2}_n,{\mathcal P}^{r,r/2}_4)=\tfrac{(n+1)r}{2}+1.$Comment: Journal Ref: Discrete Mat

On the decomposition of random hypergraphs

For an $r$-uniform hypergraph $H$, let $f(H)$ be the minimum number of complete $r$-partite $r$-uniform subhypergraphs of $H$ whose edge sets partition the edge set of $H$. For a graph $G$, $f(G)$ is the bipartition number of $G$ which was introduced by Graham and Pollak in 1971. In 1988, Erd\H{o}s conjectured that if $G \in G(n,1/2)$, then with high probability $f(G)=n-\alpha(G)$, where $\alpha(G)$ is the independence number of $G$. This conjecture and related problems have received a lot of attention recently. In this paper, we study the value of $f(H)$ for a typical $r$-uniform hypergraph $H$. More precisely, we prove that if $(\log n)^{2.001}/n \leq p \leq 1/2$ and $H \in H^{(r)}(n,p)$, then with high probability $f(H)=(1-\pi(K^{(r-1)}_r)+o(1))\binom{n}{r-1}$, where $\pi(K^{(r-1)}_r)$ is the Tur\'an density of $K^{(r-1)}_r$.Comment: corrected few typos. updated the referenc

Monochromatic 4-term arithmetic progressions in 2-colorings of Zn\mathbb Z_n

This paper is motivated by a recent result of Wolf \cite{wolf} on the minimum number of monochromatic 4-term arithmetic progressions(4-APs, for short) in $\Z_p$, where $p$ is a prime number. Wolf proved that there is a 2-coloring of $\Z_p$ with 0.000386% fewer monochromatic 4-APs than random 2-colorings; the proof is probabilistic and non-constructive. In this paper, we present an explicit and simple construction of a 2-coloring with 9.3% fewer monochromatic 4-APs than random 2-colorings. This problem leads us to consider the minimum number of monochromatic 4-APs in $\Z_n$ for general $n$. We obtain both lower bound and upper bound on the minimum number of monochromatic 4-APs in all 2-colorings of $\Z_n$. Wolf proved that any 2-coloring of $\Z_p$ has at least $(1/16+o(1))p^2$ monochromatic 4-APs. We improve this lower bound into $(7/96+o(1))p^2$. Our results on $\Z_n$ naturally apply to the similar problem on $[n]$ (i.e., $\{1,2,..., n\}$). In 2008, Parillo, Robertson, and Saracino \cite{prs} constructed a 2-coloring of $[n]$ with 14.6% fewer monochromatic 3-APs than random 2-colorings. In 2010, Butler, Costello, and Graham \cite{BCG} extended their methods and used an extensive computer search to construct a 2-coloring of $[n]$ with 17.35% fewer monochromatic 4-APs (and 26.8% fewer monochromatic 5-APs) than random 2-colorings. Our construction gives a 2-coloring of $[n]$ with 33.33% fewer monochromatic 4-APs (and 57.89% fewer monochromatic 5-APs) than random 2-colorings.Comment: 23 pages, 4 figure

Infinite Tur\'an problems for bipartite graphs

We consider an infinite version of the bipartite Tur\'{a}n problem. Let $G$ be an infinite graph with $V(G) = \mathbb{N}$ and let $G_n$ be the $n$-vertex subgraph of $G$ induced by the vertices $\{1,2, \dots, n \}$. We show that if $G$ is $K_{2,t+1}$-free then for infinitely many $n$, $e(G_n) \leq 0.471 \sqrt{t} n^{3/2}$. Using the $K_{2,t+1}$-free graphs constructed by F\"{u}redi, we construct an infinite $K_{2,t+1}$-free graph with $e(G_n) \geq 0.23 \sqrt{t}n^{3/2}$ for all $n \geq n_0$.Comment: 10 page

Spectra of edge-independent random graphs

Let $G$ be a random graph on the vertex set $\{1,2,..., n\}$ such that edges in $G$ are determined by independent random indicator variables, while the probability $p_{ij}$ for $\{i,j\}$ being an edge in $G$ is not assumed to be equal. Spectra of the adjacency matrix and the normalized Laplacian matrix of $G$ are recently studied by Oliveira and Chung-Radcliffe. Let $A$ be the adjacency matrix of $G$, \bar A=\E(A), and $\Delta$ be the maximum expected degree of $G$. Oliveira first proved that almost surely $\|A-\bar A\|=O(\sqrt{\Delta \ln n})$ provided $\Delta\geq C \ln n$ for some constant $C$. Chung-Radcliffe improved the hidden constant in the error term using a new Chernoff-type inequality for random matrices. Here we prove that almost surely $\|A-\bar A\|\leq (2+o(1))\sqrt{\Delta}$ with a slightly stronger condition $\Delta\gg \ln^4 n$. For the Laplacian $L$ of $G$, Oliveira and Chung-Radcliffe proved similar results $\|L-\bar L|=O(\sqrt{\ln n}/\sqrt{\delta})$ provided the minimum expected degree $\delta\gg \ln n$; we also improve their results by removing the $\sqrt{\ln n}$ multiplicative factor from the error term under some mild conditions. Our results naturally apply to the classic Erd\H{o}s-R\'enyi random graphs, random graphs with given expected degree sequences, and bond percolation of general graphs.Comment: 16 page

A path Turan problem for infinite graphs

Let $G$ be an infinite graph whose vertex set is the set of positive integers, and let $G_n$ be the subgraph of $G$ induced by the vertices $\{1,2, \dots , n \}$. An increasing path of length $k$ in $G$, denoted $I_k$, is a sequence of $k+1$ vertices $1 \leq i_1 < i_2 < \dots < i_{k+1}$ such that $i_1, i_2, \ldots, i_{k+1}$ is a path in $G$. For $k \geq 2$, let $p(k)$ be the supremum of $\liminf_{ n \rightarrow \infty} \frac{ e(G_n) }{n^2}$ over all $I_k$-free graphs $G$. In 1962, Czipszer, Erd\H{o}s, and Hajnal proved that $p(k) = \frac{1}{4} (1 - \frac{1}{k})$ for $k \in \{2,3 \}$. Erd\H{o}s conjectured that this holds for all $k \geq 4$. This was disproved for certain values of $k$ by Dudek and R\"{o}dl who showed that $p(16) > \frac{1}{4} (1 - \frac{1}{16})$ and $p(k) > \frac{1}{4} + \frac{1}{200}$ for all $k \geq 162$. Given that the conjecture of Erd\H{o}s is true for $k \in \{2,3 \}$ but false for large $k$, it is natural to ask for the smallest value of $k$ for which $p(k) > \frac{1}{4} ( 1 - \frac{1}{k} )$. In particular, the question of whether or not $p(4) = \frac{1}{4} ( 1 - \frac{1}{4} )$ was mentioned by Dudek and R\"{o}dl as an open problem. We solve this problem by proving that $p(4) \geq \frac{1}{4} (1 - \frac{1}{4} ) + \frac{1}{584064}$ and $p(k) > \frac{1}{4} (1 - \frac{1}{k})$ for $4 \leq k \leq 15$. We also show that $p(4) \leq \frac{1}{4}$ which improves upon the previously best known upper bound on $p(4)$. Therefore, $p(4)$ must lie somewhere between $\frac{3}{16} + \frac{1}{584064}$ and $\frac{1}{4}$Comment: 16 pages; Comments are welcom

Extensions of Erd\H{o}s-Gallai Theorem and Luo's Theorem with Applications

The famous Erd\H{o}s-Gallai Theorem on the Tur\'an number of paths states that every graph with $n$ vertices and $m$ edges contains a path with at least $\frac{2m}{n}$ edges. In this note, we first establish a simple but novel extension of the Erd\H{o}s-Gallai Theorem by proving that every graph $G$ contains a path with at least $\frac{(s+1)N_{s+1}(G)}{N_{s}(G)}+s-1$ edges, where $N_j(G)$ denotes the number of $j$-cliques in $G$ for $1\leq j\leq\omega(G)$. We also construct a family of graphs which shows our extension improves the estimate given by Erd\H{o}s-Gallai Theorem. Among applications, we show, for example, that the main results of \cite{L17}, which are on the maximum possible number of $s$-cliques in an $n$-vertex graph without a path with $l$ vertices (and without cycles of length at least $c$), can be easily deduced from this extension. Indeed, to prove these results, Luo \cite{L17} generalized a classical theorem of Kopylov and established a tight upper bound on the number of $s$-cliques in an $n$-vertex 2-connected graph with circumference less than $c$. We prove a similar result for an $n$-vertex 2-connected graph with circumference less than $c$ and large minimum degree. We conclude this paper with an application of our results to a problem from spectral extremal graph theory on consecutive lengths of cycles in graphs.Comment: 6 page

High-order Phase Transition in Random Hypergrpahs

In this paper, we study the high-order phase transition in random $r$-uniform hypergraphs. For a positive integer $n$ and a real $p\in [0,1]$, let $H:=H^r(n,p)$ be the random $r$-uniform hypergraph with vertex set $[n]$, where each $r$-set is selected as an edge with probability $p$ independently randomly. For $1\leq s \leq r-1$ and two $s$-sets $S$ and $S'$, we say $S$ is connected to $S'$ if there is a sequence of alternating $s$-sets and edges $S_0,F_1,S_1,F_2, \ldots, F_k, S_k$ such that $S_0,S_1,\ldots, S_k$ are $s$-sets, $S_0=S$, $S_k=S'$, $F_1,F_2,\ldots, F_k$ are edges of $H$, and $S_{i-1}\cup S_i\subseteq F_i$ for each $1\leq i\leq k$. This is an equivalence relation over the family of all $s$-sets ${[n]\choose s}$ and results in a partition: ${V\choose s}=\cup_i C_i$. Each $C_i$ is called an { $s$-th-order} connected component and a component $C_i$ is {\em giant} if $|C_i|=\Theta(n^s)$. We prove that the sharp threshold of the existence of the $s$-th-order giant connected components in $H^r(n,p)$ is $\frac{1}{\big({r\choose s}-1\big){n\choose r-s}}$. Let $c={n\choose r-s}p$. If $c$ is a constant and $c<\tfrac{1}{\binom{r}{s}-1}$, then with high probability, all $s$-th-order connected components have size $O(\ln n)$. If $c$ is a constant and $c > \tfrac{1}{\binom{r}{s}-1}$, then with high probability, $H^r(n,p)$ has a unique giant connected $s$-th-order component and its size is $(z+o(1)){n\choose s}$, where $$z=1-\sum_{j=0}^\infty \frac{\left({r\choose s}j -j+1 \right)^{j-1}}{j!}c^je^{-c\left({r\choose s}j -j+1\right)}.$$Comment: We revised the paper substantially based on the referees' reports and rewrote Section

Bounds for generalized Sidon sets

Let $\Gamma$ be an abelian group and $g \geq h \geq 2$ be integers. A set $A \subset \Gamma$ is a $C_h[g]$-set if given any set $X \subset \Gamma$ with $|X| = k$, and any set $\{ k_1 , \dots , k_g \} \subset \Gamma$, at least one of the translates $X+ k_i$ is not contained in $A$. For any $g \geq h \geq 2$, we prove that if $A \subset \{1,2, \dots ,n \}$ is a $C_h[g]$-set in $\mathbb{Z}$, then $|A| \leq (g-1)^{1/h} n^{1 - 1/h} + O(n^{1/2 - 1/2h})$. We show that for any integer $n \geq 1$, there is a $C_3 [3]$-set $A \subset \{1,2, \dots , n \}$ with $|A| \geq (4^{-2/3} + o(1)) n^{2/3}$. We also show that for any odd prime $p$, there is a $C_3[3]$-set $A \subset \mathbb{F}_p^3$ with $|A| \geq p^2 - p$, which is asymptotically best possible. Using the projective norm graphs from extremal graph theory, we show that for each integer $h \geq 3$, there is a $C_h[h! +1]$-set $A \subset \{1,2, \dots , n \}$ with $|A| \geq ( c_h +o(1))n^{1-1/h}$. A set $A$ is a \emph{weak $C_h[g]$-set} if we add the condition that the translates $X +k_1, \dots , X + k_g$ are all pairwise disjoint. We use the probabilistic method to construct weak $C_h[g]$-sets in $\{1,2, \dots , n \}$ for any $g \geq h \geq 2$. Lastly we obtain upper bounds on infinite $C_h[g]$-sequences. We prove that for any infinite $C_h[g$]-sequence $A \subset \mathbb{N}$, we have $A(n) = O ( n^{1 - 1/h} ( \log n )^{ - 1/h} )$ for infinitely many $n$, where $A(n) = | A \cap \{1,2, \dots , n \}|$.Comment: 10 pages. arXiv admin note: text overlap with arXiv:1306.604

Mass-size scaling M~ r^1.67 of massive star-forming clumps -- evidences of turbulence-regulated gravitational collapse

We study the fragmentation of eight massive clumps using data from ATLASGAL 870 $\mu$m, SCUBA 850 and 450 $\mu$m, PdBI 1.3 and 3.5 mm, and probe the fragmentation from 1 pc to 0.01 pc scale. We find that the masses and the sizes of our objects follow $M \sim r^{1.68\pm0.05}$. The results are in agreements with the predictions of Li (2017) where $M \sim r^{5/3}$. Inside each object, the densest structures seem to be centrally condensed, with $\rho(r)\sim r^{-2}$. Our observational results support a scenario where molecular gas in the Milky Way is supported by a turbulence characterized by a constant energy dissipation rate, and gas fragments like clumps and cores are structures which are massive enough to be dynamically detached from the ambient medium.Comment: Accepted for publication in MNRA