Related papers: On the upper tail of star counts in random graphs

In the binomial random graph $\mathcal{G}(n,p)$, when $p$ changes from $(1-\varepsilon)/n$ (subcritical case) to $1/n$ and then to $(1+\varepsilon)/n$ (supercritical case) for $\varepsilon>0$, with high probability the order of the largest…

Rank-width of a graph G, denoted by rw(G), is a width parameter of graphs introduced by Oum and Seymour (2006). We investigate the asymptotic behavior of rank-width of a random graph G(n,p). We show that, asymptotically almost surely, (i)…

Given $r$-uniform hypergraphs $G$ and $H$ the Tur\'an number $\rm ex(G, H)$ is the maximum number of edges in an $H$-free subgraph of $G$. We study the typical value of $\rm ex(G, H)$ when $G=G_{n,p}^{(r)}$, the Erd\H{o}s-R\'enyi random…

It is shown that the following holds for each $\varepsilon>0$. For $G$ an $n$-vertex graph of maximum degree $D$ and "lists" $L_v$ ($v \in V(G)$) chosen independently and uniformly from the ($(1+\varepsilon)\ln n$)-subsets of $\{1, ...,…

The extremal tail probabilities of moving sums in a marked Poisson random field is examined here. These sums are computed by adding up the weighted occurrences of events lying within a scanning set of fixed shape and size. Change of measure…

Let $H_r(n,p)$ denote the maximum number of Hamiltonian cycles in an $n$-vertex $r$-graph with density $p \in (0,1)$. The expected number of Hamiltonian cycles in the random $r$-graph model $G_r(n,p)$ is $E(n,p)=p^n(n-1)!/2$ and in the…

We study a variant of the Erd\H{o}s Matching Problem in random hypergraphs. Let $\mathcal{K}_p(n,k)$ denote the Erd\H{o}s-R\'enyi random $k$-uniform hypergraph on $n$ vertices where each possible edge is included with probability $p$. We…

In graph theory, knowing the number of complete subgraphs with r vertices that a graph g has, limits the number of its complete subgraphs with s vertices, for s > r. A useful upper bound is provided by the Kruskal-Katona theorem, but this…

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,…

This paper provides an overview of results, concerning longest or heaviest paths, in the area of random directed graphs on the integers along with some extensions. We study first-order asymptotics of heaviest paths allowing weights both on…

We consider the problem of sampling and approximately counting an arbitrary given motif $H$ in a graph $G$, where access to $G$ is given via queries: degree, neighbor, and pair, as well as uniform edge sample queries. Previous algorithms…

Let $G$ be a connected graph with $n$ vertices and $n+k-2$ edges and $tK_m$ denote the disjoint union of $t$ complete graphs $K_m$. In this paper, by developing a trichotomy for sparse graphs, we show that for given integers $m\ge 2$ and…

Let X be the random variable that counts the number of triangles in the random graph G(n,p). We show that for some absolute constant c, the probability that X deviates from its expectation by at least \lambda \var(X)^{1/2} is at most…

A double star $S(n,m)$ is the graph obtained by joining the center of a star with $n$ leaves to a center of a star with $m$ leaves by an edge. Let $r(S(n,m))$ denote the Ramsey number of the double star $S(n,m)$. In 1979 Grossman, Harary…

A \textit{star $k$-coloring} of a graph $G$ is a proper (vertex) $k$-coloring of $G$ such that the vertices on a path of length three receive at least three colors. Given a graph $G$, its \textit{star chromatic number}, denoted $\chi_s(G)$,…

The \textit{set-coloring Ramsey number} $\mathrm{R}_{r, s}(G_1,G_2,...,G_r)$ is the least $n \in \mathbb{N}$ such that every coloring $\chi: E\left(K_n\right) \rightarrow\binom{[r]}{s}$ contains a monochromatic copy of $G_i$, that is, a…

For a graph $G$, denote by $t_r(G)$ (resp. $b_r(G)$) the maximum size of a $K_r$-free (resp. $(r-1)$-partite) subgraph of $G$. Of course $t_r(G) \geq b_r(G)$ for any $G$, and Tur\'an's Theorem says that equality holds for complete graphs.…

Given an underlying undirected simple graph, we consider the set of all acyclic orientations of its edges. Each of these orientations induces a partial order on the vertices of our graph and, therefore, we can count the number of linear…

Consider a random walk $S=(S_n:n\geq 0)$ that is ``perturbed'' by a stationary sequence $(\xi_n:n\geq 0)$ to produce the process $(S_n+\xi_n:n\geq0)$. This paper is concerned with computing the distribution of the all-time maximum…

In many areas of interest, modern risk assessment requires estimation of the extremal behaviour of sums of random variables. We derive the first order upper-tail behaviour of the weighted sum of bivariate random variables under weak…