Related papers: Rainbow Thresholds
In this paper, we prove a threshold result for the Robin problem of semilinear parabolic equations
In 2019, Aharoni proposed a conjecture generalizing the Caceetta-H\"aggkvist conjecture: if an $n$-vertex graph $G$ admits an edge coloring (not necessarily proper) with $n$ colors such that each color class has size at least $r$, then $G$…
In this paper, we present results for the rainbow neighbourhood numbers of set-graphs. It is also shown that set-graphs are perfect graphs. The intuitive colouring dilemma in respect of the rainbow neighbourhood convention is clarified as…
The current status of the theory of and the experimental evidence for color transparency are reviewed. The problems with interpretation of quasielastic scattering on nuclei are discussed to some detail.
In stochastic geometry there are several instances of threshold phenomena in high dimensions: the behavior of a limit of some expectation changes abruptly when some parameter passes through a critical value. This note continues the…
Threshold queries are an important class of queries that only require computing or counting answers up to a specified threshold value. To the best of our knowledge, threshold queries have been largely disregarded in the research literature,…
We give a snapshot of recent progress in solving the Dyson-Schwinger equation with a beyond rainbow-ladder ansatz for the dressed quark-gluon vertex which includes ghost contributions. We discuss the motivations for this approach with…
Let $\mathbf{G}:=(G_1, G_2, G_3)$ be a triple of graphs on a common vertex set $V$ of size $n$. A rainbow triangle in $\mathbf{G}$ is a triple of edges $(e_1, e_2, e_3)$ with $e_i\in G_i$ for each $i$ and $\{e_1, e_2, e_3\}$ forming a…
A threshold result was proved in this paper for semilinear parabolic system with pure power type nonlinearities
We provide a lower bound on the probability that a binomial random variable is exceeding its mean. Our proof employs estimates on the mean absolute deviation and the tail conditional expectation of binomial random variables.
Given $n\in k\mathbb{N}$ elements set $V$ and $k$-uniform hypergraphs $\mathcal{H}_1,\ldots,\mathcal{H}_{n/k}$ on $V$. A rainbow perfect matching is a collection of pairwise disjoint edges $E_1\in \mathcal{H}_1,\ldots,E_{n/k}\in…
The article presents new results on the use of variable thresholds to increase the capacity of a feedback neural network. Non-binary networks are also considered in this analysis.
New explicit procedures for passing among triplane diagrams, braid movies, and braid charts for knotted surfaces in $\mathbb{R}^4$ are presented. To this end, rainbow diagrams, which lie between braid charts and triplanes, are introduced.…
We show that for any integer $t \ge 2$, every properly edge colored $n$-vertex graph with average degree at least $(\log n)^{2+o(1)}$ contains a rainbow subdivision of a complete graph of size $t$. Note that this bound is within $(\log…
Ground-state, radially-excited and exotic scalar-, vector- and flavoured-pseudoscalar-mesons are studied in rainbow-ladder truncation using an interaction kernel that is consonant with modern DSE- and lattice-QCD results. The inability of…
I survey the theoretical and experimental information available for determination of |Vub| with inclusive and exclusive techniques. Using recent experimental and theoretical advances, I outline a procedure in which the inclusive information…
This book pretends to compile the latest advances on vector-valued Banach limits as well as their applications to vector-valued almost convergence.
Let $G = (V, E)$ be an $n$-vertex edge-colored graph. In 2013, H. Li proved that if every vertex $v \in V$ is incident to at least $(n+1)/2$ distinctly colored edges, then $G$ admits a rainbow triangle. We prove that the same hypothesis…
A meta-conjecture of Coulson, Keevash, Perarnau and Yepremyan states that above the extremal threshold for a given spanning structure in a (hyper-)graph, one can find a rainbow version of that spanning structure in any suitably bounded…
A \textit{rainbow subgraph} of an edge-colored graph is a subgraph whose edges have distinct colors. The \textit{color degree} of a vertex $v$ is the number of different colors on edges incident to $v$. We show that if $n$ is large enough…