Related papers: Large cliques in extremal incidence configurations
We study the set ${\cal L}(G)$ of lengths of all cycles that appear in a random $d$-regular $G$ on $n$ vertices for a fixed $d\geq 3$, as well as in Erd\H{o}s--R\'enyi random graphs on $n$ vertices with a fixed average degree $c>1$.…
Let ccl(G) denote the order of the largest complete minor in a graph G (also called the contraction clique number) and let G(n,p) denote a random graph on n vertices with edge probability p. Bollobas, Catlin and Erdos asymptotically…
The problem of determining the maximum number of copies of $T$ in an $H$-free graph, for any graphs $T$ and $H$, was considered by Alon and Shikhelman. This is a variant of Tur\'{a}n's classical extremal problem. We show lower and upper…
We study the problem of approximating the number of $k$-cliques in a graph when given query access to the graph. We consider the standard query model for general graphs via (1) degree queries, (2) neighbor queries and (3) pair queries. Let…
A maximum entropy theorem is developed and tested for granular contact forces. Although it is idealized, describing two dimensional packings of round, rigid, frictionless, cohesionless disks with coordination number Z=4, it appears to…
We study percolation on the hierarchical lattice of order $N$ where the probability of connection between two points separated by distance $k$ is of the form $c_k/N^{k(1+\delta)},\; \delta >-1$. Since the distance is an ultrametric, there…
Concentration of distances in high dimension is an important factor for the development and design of stable and reliable data analysis algorithms. In this paper, we address the fundamental long-standing question about the concentration of…
We study the distribution of finite clusters in slightly supercritical ($p \downarrow p_c$) Bernoulli bond percolation on transitive nonamenable graphs, proving in particular that if $G$ is a transitive nonamenable graph satisfying the…
The Pauli exclusion principle gives an upper bound of 1 on the natural occupation numbers. Recently there has been an intriguing amount of theoretical evidence that there is a plethora of additional generalized Pauli restrictions or…
Let $G$ be a graph and $t\ge 0$. A new graph parameter termed the largest reduced neighborhood clique cover number of $G$, denoted by ${\hat\beta}_t(G)$, is introduced. Specifically, ${\hat\beta}_t(G)$ is the largest, overall $t$-shallow…
In this note, we show that extremal Szemer\'{e}di-Trotter configurations are rigid in the following sense: If $P,L$ are sets of points and lines determining at least $C|P|^{2/3}|L|^{2/3}$ incidences, then there exists a collection $P'$ of…
With $\xi_{k}=\xi_{k}^{n,p}$ the number of copies of $K_k$ in the usual (Erd\H{o}s-R\'enyi) random graph $G(n,p)$, $p\geq n^{-2/(k-1)}$ and $\eta>0$, we show when $k>1$ $$\Pr(\xi_k> (1+\eta)\E \xi_k) < \exp [-\gO_{\eta,k}…
Given a closed subscheme $Z$ in a smooth variety $X$, defined by the maximal minors of an $s\times r$ matrix of regular functions, with $s\geq r$, we consider the corresponding incidence correspondence $W$ in $Y=X\times {\mathbf P}^{r-1}$,…
We prove that Sherali-Adams with polynomially bounded coefficients requires proofs of size $n^{\Omega(d)}$ to rule out the existence of an $n^{\Theta(1)}$-clique in Erd\H{o}s-R\'{e}nyi random graphs whose maximum clique is of size $d\leq…
We study the asymptotic distribution of the number of matchings of size $\ell=\ell(n)$ in $G(n,p)$ for a wide range of $p=p(n)\in (0,1)$ and for every $1\le \ell\le \lfloor n/2\rfloor$. We prove that this distribution changes from normal to…
Multiple interval graphs are variants of interval graphs where instead of a single interval, each vertex is assigned a set of intervals on the real line. We study the complexity of the MAXIMUM CLIQUE problem in several classes of multiple…
Explosive percolation (EP) has received significant research attention due to its rich and anomalous phenomena near criticality. In our recent study [Phys. Rev. Lett. 130, 147101 (2023)], we demonstrated that the correct critical behaviors…
We study the statistics and characteristics of rare intense events in two types of two dimensional Complex Ginzburg-Landau (CGL) equation based models. Our numerical simulations show finite amplitude collapse-like solutions which approach…
Let $V$ be a finite dimensional vector space over a finite field, and $\mathcal{F}$ a family consisting of $k$-subspaces of $V$. The family $\mathcal{F}$ is called $t$-intersecting if $\dim(F_{1}\cap F_{2})\geq t$ for any $F_{1}, F_{2}\in…
A geometric intersection graph is constructed over a set of geometric objects, where each vertex represents a distinct object and an edge connects two vertices if and only if the corresponding objects intersect. We examine the problem of…