11,500 research outputs found
More on Rainbow Cliques in Edge-Colored Graphs
In an edge-colored graph , a rainbow clique is a -complete
subgraph in which all the edges have distinct colors. Let and be
the number of edges and colors in , respectively. In this paper, we show
that for any , if and , then for
sufficiently large , the number of rainbow cliques in is
.
We also characterize the extremal graphs without a rainbow clique ,
for , when is maximum.
Our results not only address existing questions but also complete the
findings of Ehard and Mohr (Ehard and Mohr, Rainbow triangles and cliques in
edge-colored graphs. {\it European Journal of Combinatorics, 84:103037,2020}).Comment: 16page
Note on vertex disjoint rainbow triangles in edge-colored graphs
Given an edge-colored graph , we denote the number of colors as ,
and the number of edges as . An edge-colored graph is rainbow if no two
edges share the same color. A proper is a vertex disjoint union of
rainbow triangles. Rainbow problems have been studied extensively in the
context of anti-Ramsey theory, and more recently, in the context of Tur\'{a}n
problems. B. Li. et al. \textit{European J. Combin. 36 (2014)} found that a
graph must contain a rainbow triangle if . L.
Li. and X. Li. \textit{Discrete Applied Mathematics 318 (2022)} conjectured a
lower bound on such that must contain a proper . In this
paper, we provide a construction that disproves the conjecture. We also
introduce a result that guarantees the existence of vertex disjoint rainbow
subgraphs in general host graphs, and a sharp result on the existence of
proper in complete graphs
On small Mixed Pattern Ramsey numbers
We call the minimum order of any complete graph so that for any coloring of
the edges by colors it is impossible to avoid a monochromatic or rainbow
triangle, a Mixed Ramsey number. For any graph with edges colored from the
above set of colors, if we consider the condition of excluding in the
above definition, we produce a \emph{Mixed Pattern Ramsey number}, denoted
. We determine this function in terms of for all colored -cycles
and all colored -cliques. We also find bounds for when is a
monochromatic odd cycles, or a star for sufficiently large . We state
several open questions.Comment: 16 page
Using Ramsey theory to measure unavoidable spurious correlations in Big Data
Given a dataset we quantify how many patterns must always exist in the
dataset. Formally this is done through the lens of Ramsey theory of graphs, and
a quantitative bound known as Goodman's theorem. Combining statistical tools
with Ramsey theory of graphs gives a nuanced understanding of how far away a
dataset is from random, and what qualifies as a meaningful pattern.
This method is applied to a dataset of repeated voters in the 1984 US
congress, to quantify how homogeneous a subset of congressional voters is. We
also measure how transitive a subset of voters is. Statistical Ramsey theory is
also used with global economic trading data to provide evidence that global
markets are quite transitive.Comment: 21 page
- …