Related papers: Large cliques in extremal incidence configurations
In this paper, we consider proving inapproximability in terms of OPT and thus we base the foundations of fixed parameter inapproximability.
Maximal clique enumeration is a fundamental graph mining task, but its utility is often limited by computational intractability and highly redundant output. To address these challenges, we introduce \emph{$\rho$-dense aggregators}, a novel…
We consider the problem of sketching the $p$-th frequency moment of a vector, $p>2$, with multiplicative error at most $1\pm \epsilon$ and \emph{with high confidence} $1-\delta$. Despite the long sequence of work on this problem, tight…
We prove the first inverse theorem for point--sphere incidence bounds over finite fields in dimensions $d \ge 3$, showing that near-extremality forces algebraic rigidity. While sharp upper bounds have been known for over a decade, the…
We investigate exceedances of the process over a sufficiently high threshold. The exceedances determine the risk of hazardous events like climate catastrophes, huge insurance claims, the loss and delay in telecommunication networks. Due to…
We show that $3$-uniform hypergraphs with the property that all vertices have a quasirandom link graph with density bigger than $1/3$ contain a clique on five vertices. This result is asymptotically best possible.
One major open conjecture in the area of critical random graphs, formulated by statistical physicists, and supported by a large amount of numerical evidence over the last decade [23, 24, 28, 63] is as follows: for a wide array of random…
The famous Erd\H{o}s-Rademacher problem asks for the smallest number of $r$-cliques in a graph with the given number of vertices and edges. Despite decades of active attempts, the asymptotic value of this extremal function for all $r$ was…
We study the Landau-Zener-Stueckelberg (LZS) effect for a two-level system with a time-dependent nonlinear bias field (the sweep function) W(t). Our main concern is to investigate the influence of the nonlinearity of W(t) on the probability…
In Clique Cover, given a graph $G$ and an integer $k$, the task is to partition the vertices of $G$ into $k$ cliques. Clique Cover on unit ball graphs has a natural interpretation as a clustering problem, where the objective function is the…
For $r,n\ge2$, an ordered $r$-uniform matching of size $n$ is an $r$-uniform hypergraph on a linearly ordered vertex set $V$, with $|V|=rn$, consisting of $n$ pairwise disjoint edges. There are $\tfrac12\binom{2r}r$ different ways two edges…
We study the probability densities of finite-time or \local Lyapunov exponents (LLEs) in low-dimensional chaotic systems. While the multifractal formalism describes how these densities behave in the asymptotic or long-time limit, there are…
We study the distribution of the set of copies of some given graph $H$ in the random graph $G(n,p)$, focusing on the case when $H = K_r$. Our main results capture the 'leading term' in the difference between this distribution and the…
A wide array of random graph models have been postulated to understand properties of observed networks. Typically these models have a parameter $t$ and a critical time $t_c$ when a giant component emerges. It is conjectured that for a large…
The local number variance associated with a spherical sampling window of radius $R$ enables a classification of many-particle systems in $d$-dimensional Euclidean space according to the degree to which large-scale density fluctuations are…
We consider the problem of finding a small hitting set in an {\it infinite} range space $\cF=(Q,\cR)$ of bounded VC-dimension. We show that, under reasonably general assumptions, the infinite dimensional convex relaxation can be solved…
Let $P$ be a $\delta$-separated $(\delta, s, C_P)$-set of points in $B(0, 1)\subset \mathbb{R}^d$ and $\Pi$ be a $\delta$-separated $(\delta, t, C_\Pi)$-set of hyperplanes intersecting $B(0, 1)$ in $\mathbb{R}^d$. Define \[I_{C\delta}(P,…
In extremal graph theory, the problem of finding the elements of a given class of graphs which contain the most cliques traces its routes back to Tur\'an's famous theorem. We consider the implications of the connectivity property of…
We report a novel critical behavior in the breakdown of an equal load sharing fiber bundle model at a dispersion $\delta_c$ of the breaking threshold of the fibers. For $\delta < \delta_c$, there is a finite probability $P_b$, that…
We say that a set $A$ \emph{$t$-intersects} a set $B$ if $A$ and $B$ have at least $t$ common elements. Two families $\mathcal{A}$ and $\mathcal{B}$ are said to be \emph{cross-$t$-intersecting} if each set in $\mathcal{A}$ $t$-intersects…