Related papers: Exclusivity principle, Ramsey theory, and $n$-cycl…
Erd\H{o}s and Szekeres's quantitative version of Ramsey's theorem asserts that any complete graph on n vertices that is edge-colored with two colors has a monochromatic clique on at least 1/2log(n) vertices. The famous Erd\H{o}s-Hajnal…
We show that a recent observation by Yan leads to a method to experimentally test whether a higher-than-quantum violation of the Clauser-Horne-Shimony-Holt Bell inequality is possible (assuming that the sum of probabilities of pairwise…
Reichenbach's Common Cause Principle claims that if there is correlation between two events and none of them is directly causally influenced by the other, then there must exist a third event that can, as a common cause, account for the…
We study graphs with the property that every edge-colouring admits a monochromatic cycle (the length of which may depend freely on the colouring) and describe those graphs that are minimal with this property. We show that every member in…
We describe a construction that maps any connected graph G on three or more vertices into a larger graph, H(G), whose independence number is strictly smaller than its Lov\'asz number which is equal to its fractional packing number. The…
The Ramsey number $r(H)$ of a graph $H$ is the minimum integer $n$ such that any two-coloring of the edges of the complete graph $K_n$ contains a monochromatic copy of $H$. While this definition only asks for a single monochromatic copy of…
A discrete analog of quantum unique ergodicity was proved for Cayley graphs of quasirandom groups by Magee, Thomas and Zhao. They show that for large graphs there exist real orthonormal basis of eigenfunctions of the adjacency matrix such…
Bell experiment in the network gives rise to a form of quantum nonlocality which is conceptually different from traditional multipartite Bell nonlocality. Conventional multipartite Bell experiment features a single source that distributes…
Breaking of equivalence between the microcanonical ensemble and the canonical ensemble, describing a large system subject to hard and soft constraints, respectively, was recently shown to occur in large random graphs. Hard constraints must…
We propose an efficient approach to prepare Einstein-Podolsky-Rosen (EPR) pairs in currently existing Josephson nanocircuits with capacitive couplings. In these fixed coupling circuits, two-qubit logic gates could be easily implemented…
A classical result of Nosal asserts that every $m$-edge graph with spectral radius $\lambda (G)> \sqrt{m}$ contains a triangle. A celebrated extension of Nikiforov [35] states that if $G$ is an $m$-edge graph with $\lambda (G)> \sqrt{(1-…
The Erd\H{o}s--Gallai Theorem states that for $k\geq 3$ every graph on $n$ vertices with more than $\frac{1}{2}(k-1)(n-1)$ edges contains a cycle of length at least $k$. Kopylov proved a strengthening of this result for 2-connected graphs…
Sidorenko's conjecture states that, for all bipartite graphs $H$, quasirandom graphs contain asymptotically the minimum number of copies of $H$ taken over all graphs with the same order and edge density. While still open for graphs, the…
In a previous paper certain measurable criteria have been derived, that are sufficient to demonstrate the existence of Einstein-Podolsky-Rosen (EPR) correlations for measurements with continuous variable outcomes. Here it is shown how such…
The famous singlet correlations of a composite quantum system consisting of two spatially separated components exhibit notable features of two kinds. The first kind consists of striking certainty relations: perfect correlation and perfect…
A construction described by the current author in 2017 uses two linear `prototype' graphs to build a compound graph with Ramsey properties inherited from the prototypes. This paper describes a generalisation of that construction which has…
For $t \in \mathbb{N}$, we say that a colouring of $E(K_n)$ is $\textit{almost}$ $t$-$\textit{Gallai}$ if no two rainbow $t$-cliques share an edge. Motivated by a lemma of Berkowitz on bounding the modulus of the characteristic function of…
Similar formalisms have been independently developed in psychology, to deal with the issue of selective influences (deciding which of several experimental manipulations selectively influences each of several, generally non-independent,…
Let $G_n$ be the coprime graph on $\{1,\ldots,n\}$. We prove that the mixed vertex-coloring coprime Ramsey number satisfies \[ \Rcop(k_1,\ldots,k_c)=p_{\sum_{i=1}^c(k_i-1)}, \] where $p_m$ is the $m$-th prime. The proof is elementary: the…
For random systems subject to a constraint, the microcanonical ensemble requires the constraint to be met by every realisation ("hard constraint"), while the canonical ensemble requires the constraint to be met only on average ("soft…