相关论文: On a Question of Gowers on Clique Differences
We prove that for $k \ll \sqrt[4]{n}$ regular resolution requires length $n^{\Omega(k)}$ to establish that an Erd\H{o}s-R\'enyi graph with appropriately chosen edge density does not contain a $k$-clique. This lower bound is optimal up to…
Emergence of dominating cliques in Erd\"os-R\'enyi random graph model ${\bbbg(n,p)}$ is investigated in this paper. It is shown this phenomenon possesses a phase transition. Namely, we have argued that, given a constant probability $p$, an…
We prove the Categorified Wrapping Number Conjecture for large classes of annular links, including alternating annular links and tangle closures exhibiting plumbed link phenomena. We do so by characterizing when a resolution is sufficient…
The Kepler conjecture asserts that no packing of congruent balls in three-dimensional Euclidean space has density greater than that of the face-centered cubic packing. The original proof, announced in 1998 and published in 2006, is long and…
Given an infinite word over the alphabet $\{0,1,2,3\}$, we define a class of bipartite hereditary graphs $\mathcal{G}^\alpha$, and show that $\mathcal{G}^\alpha$ has unbounded clique-width unless $\alpha$ contains at most finitely many…
A classical theorem of Szeg\H{o} states that for any probability measure $\mu=w\frac{\mathrm{d}\theta}{2\pi}+\mu_s$ on the unit circle the polynomials are dense in $L^2(\mathbb{T},\mu)$ if and only if $\log(w)\notin L^1(\mathbb{T})$. A…
We study the asymptotic behavior of the clique number in rank-1 inhomogeneous random graphs, where edge probabilities between vertices are roughly proportional to the product of their vertex weights. We show that the clique number is…
In [2], while studying a relevant class of polyominoes that tile the plane by translation, i.e., double square polyominoes, the authors found that their boundary words, encoded by the Freeman chain coding on a four letters alphabet, have…
The Erd\H{o}s-Hajnal conjecture is one of the most classical and well-known problems in extremal and structural combinatorics dating back to 1977. It asserts that in stark contrast to the case of a general $n$-vertex graph if one imposes…
There is a long line of research in the literature dedicated to word-representable graphs, which generalize several important classes of graphs. However, not much is known about word-representability of split graphs, another important class…
There are no square $L^2$-flat sequences of polynomials of the type $$\frac{1}{\sqrt q}( \epsilon_0 + \epsilon_1z + \epsilon_2z^2 + \cdots + \epsilon_{q-2}z^{q-2} +\epsilon_q z^{q-1}),$$ where for each $j,~~ 0 \leq j\leq q-1,~\epsilon_j =…
In this work we deal with dicritical divisors, curvettes and polynomials. These objects have been one of the main research interests of S.S. Abhyankar during his last years. In this work we provide some elementary proofs of some S.S.…
We are given a graph $G$ with $n$ vertices, where a random subset of $k$ vertices has been made into a clique, and the remaining edges are chosen independently with probability $\tfrac12$. This random graph model is denoted…
We prove an equivalence between a conjecture of Neumann and Praeger on Kronecker classes in algebraic number fields, and a conjecture on cliques of derangement graphs in combinatorics.
The implicit graph conjecture states that every sufficiently small, hereditary graph class has a labeling scheme with a polynomial-time computable label decoder. We approach this conjecture by investigating classes of label decoders defined…
We prove that for every integer $n > 0$ and for every alphabet $\Sigma_k$ of size $k \geq 3$, there exists a necklace of length $n$ whose Burrows-Wheeler Transform (BWT) is completely unclustered, i.e., it consists of exactly $n$ runs with…
We show that for each $r\ge 4$, in a density range extending up to, and slightly beyond, the threshold for a $K_r$-factor, the copies of $K_r$ in the random graph $G(n,p)$ are randomly distributed, in the (one-sided) sense that the…
Daligault, Rao and Thomass\'e asked whether a hereditary class of graphs well-quasi-ordered by the induced subgraph relation has bounded clique-width. Lozin, Razgon and Zamaraev recently showed that this is not true for classes defined by…
We show that there exist absolute constants $\Delta > \delta > 0$ such that, for all $n \geqslant 2$, there exists a polynomial $P$ of degree $n$, with $\pm 1$ coefficients, such that $$\delta\sqrt{n} \leqslant |P(z)| \leqslant…
We prove that a hereditary class of graphs is $(\mathsf{tw}, \omega)$-bounded if and only if the induced minors of the graphs from the class form a $(\mathsf{tw}, \omega)$-bounded class.