Related papers: Two-color exchangeability does not imply exchangea…
We give a short, explicit proof of Hindman's Theorem that in every finite coloring of the integers, there is an infinite set all of whose finite sums have the same color. We give several exampls of colorings of the integers which do not…
We exactly evaluate the entanglement of a six vertex and a nine vertex graph states which correspond to non ''two-colorable'' graphs. The upper bound of entanglement for five vertices ring graph state is improved to 2.9275, less than upper…
It was found by Perdew, Parr, Levy, and Balduz [Phys. Rev. Lett. {\bf 49}, 1691 (1982)] and by Sham and Schl\"uter [Phys. Rev. Lett. {\bf 51}, 1884 (1983)] that the exact Kohn-Sham exchange-correlation potential of an open system may jump…
Twisted links are a generalization of classical links and correspond to stably equivalence classes of links in thickened surfaces. In this paper we introduce twisted intersection colorings of a diagram and construct two invariants of a…
We show that anagram-free vertex colouring a $2\times n$ square grid requires a number of colours that increases with $n$. This answers an open question in Wilson's thesis and shows that even graphs of pathwidth $2$ do not have anagram-free…
The existing evidence for dual superconductivity as mechanism of color confinement is reviewed. We also discuss what is known on the dual excitations, which produce confinement by condensation, and what are the open problems
Perfect colouring of isonemal fabrics by thin and thick striping of warp and weft with more than two colours is examined where the cells with warps and wefts of the same colour do not appear along diagonal lines (not twilly redundancy). In…
Non-closedness of subexponentiality by the convolution operation is well-known. We go a step further and show that subexponentiality and non-subexponentiality are generally changeable by the convolution. We also give several conditions, by…
The finite satisfiability problem of two-variable logic extended by a linear order successor and a preorder successor is shown to be undecidable.
A graph $G$ is class II, if its chromatic index is at least $\Delta+1$. Let $H$ be a maximum $\Delta$-edge-colorable subgraph of $G$. The paper proves best possible lower bounds for $\frac{|E(H)|}{|E(G)|}$, and structural properties of…
We investigate how to model exchangeability with choice functions. Exchangeability is a structural assessment on a sequence of uncertain variables. We show how such assessments are a special indifference assessment, and how that leads to a…
Exchangeability -- in which the distribution of an infinite sequence is invariant to reorderings of its elements -- implies the existence of a simple conditional independence structure that may be leveraged in the design of statistical…
Given two graphs G and H, there is a bi-resolving (or bi-covering) graph homomorphism from G to H if and only if their adjacency matrices satisfy certain matrix relations. We investigate the bi-covering extensions of bi-resolving…
We compute the limit distribution for (centered and scaled) length of the longest increasing subsequence of random colored permutations. The limit distribution function is a power of that for usual random permutations computed recently by…
We prove Tur\'an-type theorems for two related Ramsey problems raised by Bollob\'as and by Fox and Sudakov. First, for $t \ge 3$, we show that any two-colouring of the complete graph on $n$ vertices that is $\delta$-far from being…
We investigate the terminal-pairibility problem in the case when the base graph is a complete bipartite graph, and the demand graph is also bipartite with the same color classes. We improve the lower bound on maximum value of $\Delta(D)$…
Given a graph G, a colouring is an assignment of colours to the vertices of G so that no two adjacent vertices are coloured the same. If all colour classes have size at most t, then we call the colouring t-bounded, and the t-bounded…
In this paper, we introduce the notion of 2-boundary planar graphs. A graph is 2-boundary planar if it has an embedding in the plane so that all vertices lie on the boundary of at most two faces and no edges are crossed. A proper coloring…
We present results on partitioning the vertices of $2$-edge-colored graphs into monochromatic paths and cycles. We prove asymptotically the two-color case of a conjecture of S\'ark\"ozy: the vertex set of every $2$-edge-colored graph can be…
A subgraph in an edge-colored graph is multicolored if all its edges receive distinct colors. In this paper, we study the proper edge-colorings of the complete bipartite graph $K_{m,n}$ which forbid multicolored cycles. Mainly, we prove…