Results 11 to 20 of about 404,055 (327)
Rainbow Paths and Large Rainbow Matchings [PDF]
The Electronic Journal of Combinatorics, 2022 A conjecture of the first two authors is that $n$ matchings of size $n$ in any graph have a rainbow matching of size $n-1$. We prove a lower bound of $\frac{2}{3}n-1$, improving on the trivial $\frac{1}{2}n$, and an analogous result for hypergraphs. For $\{C_3,C_5\}$-free graphs and for disjoint matchings we obtain a lower bound of $\frac{3n}{4}-O(1)
Aharoni, Ron +3 more
openaire +3 more sources
Victorian Rainbow Makers: Variations on Colour Poetics
Angles, 2017 In his 1993 book retracing the history of synthetic dyestuffs, Anthony S. Travis describes the 19th century chemists who devised new aniline dyes for the expanding textile industry as “rainbow makers”.
Charlotte Ribeyrol
doaj +1 more source
Computing Minimum Rainbow and Strong Rainbow Colorings of Block Graphs [PDF]
, 2018 A path in an edge-colored graph $G$ is rainbow if no two edges of it are colored the same. The graph $G$ is rainbow-connected if there is a rainbow path between every pair of vertices.
Keranen, Melissa, Lauri, Juho
core +3 more sources
On the fine-grained complexity of rainbow coloring [PDF]
, 2016 The Rainbow k-Coloring problem asks whether the edges of a given graph can be colored in $k$ colors so that every pair of vertices is connected by a rainbow path, i.e., a path with all edges of different colors.
Kowalik, Łukasz +2 more
core +3 more sources
Rainbow Matchings and Rainbow Connectedness [PDF]
The Electronic Journal of Combinatorics, 2017 Aharoni and Berger conjectured that every collection of $n$ matchings of size $n+1$ in a bipartite graph contains a rainbow matching of size $n$. This conjecture is related to several old conjectures of Ryser, Brualdi, and Stein about transversals in Latin squares. There have been many recent partial results about the Aharoni-Berger Conjecture.
openaire +5 more sources
Rainbow Coloring Hardness via Low Sensitivity Polymorphisms [PDF]
, 2019 A k-uniform hypergraph is said to be r-rainbow colorable if there is an r-coloring of its vertices such that every hyperedge intersects all r color classes.
Guruswami, Venkatesan, Sandeep, Sai
core +1 more source
Research on rainbow probabilistic forecast model based on meteorological conditions in ZhaoSu region
Meteorological Applications, 2023 An analysis of artificial rainbow observations in ZhaoSu region from 2017 to 2019 shows that rainbows mainly occur between 16:00 and 22:00 (LST) from April to September.
Jing Liu +6 more
doaj +1 more source
Hardness and Algorithms for Rainbow Connectivity [PDF]
, 2009 An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted rc(G), is the smallest number of colors that are needed in order to make G
Chakraborty, Sourav +3 more
core +4 more sources
International Journal of Modern Physics A, 2009 Noncommutative quantum field theories and their global quantum group symmetries provide an intriguing attempt to go beyond the realm of standard local quantum field theory. A common feature of these models is that the quantum group symmetry of their Hilbert spaces induces additional structure in the multiparticle states which reflects a nontrivial ...
Arzano, Michele, Benedetti, Dario
openaire +2 more sources
Integrated Environmental Assessment and Management, EarlyView., 2023 Abstract In the Lake Koocanusa‐Kootenai River system (Montana, USA and British Columbia, Canada), selenium (Se) contamination has become an international concern and is suspected to contribute to the observed burbot (Lota lota) population collapse. Due to our limited ability to sample burbot in Lake Koocanusa for monitoring studies, we used a reference
Stephanie D. Graves +6 more
wiley +1 more source