<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-04-17T17:12:07Z</responseDate><request verb="GetRecord" identifier="oai:www.recercat.cat:2117/459514" metadataPrefix="oai_dc">https://recercat.cat/oai/request</request><GetRecord><record><header><identifier>oai:recercat.cat:2117/459514</identifier><datestamp>2026-03-26T07:48:13Z</datestamp><setSpec>com_2072_1033</setSpec><setSpec>col_2072_452950</setSpec></header><metadata><oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
   <dc:title>Rainbow connectivity of multilayered random geometric graphs</dc:title>
   <dc:creator>Díaz Cort, Josep</dc:creator>
   <dc:creator>Diner, Oznur Y.</dc:creator>
   <dc:creator>Serra Albó, Oriol</dc:creator>
   <dc:creator>Serna Iglesias, María José</dc:creator>
   <dc:contributor>Universitat Politècnica de Catalunya. Departament de Matemàtiques</dc:contributor>
   <dc:contributor>Universitat Politècnica de Catalunya. Departament de Ciències de la Computació</dc:contributor>
   <dc:contributor>Universitat Politècnica de Catalunya. GAPCOMB - Geometric, Algebraic and Probabilistic Combinatorics</dc:contributor>
   <dc:contributor>Universitat Politècnica de Catalunya. ALBCOM - Algorísmia, Bioinformàtica, Complexitat i Mètodes Formals</dc:contributor>
   <dc:subject>Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta</dc:subject>
   <dc:subject>Classificació AMS::05 Combinatorics::05C Graph theory</dc:subject>
   <dc:description>An edge-colored multigraph G is rainbow connected if every pair of vertices is joined by at least one rainbow path, i.e., a path where no two edges are of the same color. In the context of multilayered networks, we introduce the notion of multilayered random geometric graphs, from h = 2 independent random geometric graphs G(n,r) on the unit square. We define an edge-coloring by coloring the edges according to the copy of G(n,r) they belong to and study the rainbow connectivity of the resulting edge-colored multigraph. We show that r(n) = lnn nh-1 1/2h , is a threshold of the radius for the property of being rainbow connected. This complements the known analogous results for the multilayered graphs defined on the Erdos–Rényi random model.</dc:description>
   <dc:description>Peer Reviewed</dc:description>
   <dc:description>Postprint (published version)</dc:description>
   <dc:date>2024</dc:date>
   <dc:type>Conference report</dc:type>
   <dc:identifier>Diaz, J. [et al.]. Rainbow connectivity of multilayered random geometric graphs. A: Discrete Mathematics Days. «DMD 2024: Discrete Mathematics Days: Alcalá de Henares, Espanya, Julio 3-5, 2024». Alcalá de Henares: Universidad de Alcalá, 2024, p. 160-165. ISBN 978-84-18979-38-5.</dc:identifier>
   <dc:identifier>978-84-18979-38-5</dc:identifier>
   <dc:identifier>https://hdl.handle.net/2117/459514</dc:identifier>
   <dc:identifier>https://hdl.handle.net/2117/459514</dc:identifier>
   <dc:language>eng</dc:language>
   <dc:relation>https://dmd2024.web.uah.es/files/abstracts/paper_29.pdf</dc:relation>
   <dc:relation>info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2020-112581GB-C21/ES/MODELOS Y TECNICAS PARA EL PROCESAMIENTO DE INFORMACION A  GRAN ESCALA -- BARCELONA/</dc:relation>
   <dc:relation>info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2020-113082GB-I00/ES/COMBINATORIA: NUEVAS TENDENCIAS Y APLICACIONES/</dc:relation>
   <dc:rights>http://creativecommons.org/licenses/by-nc-sa/4.0/</dc:rights>
   <dc:rights>Open Access</dc:rights>
   <dc:rights>Attribution-NonCommercial-ShareAlike 4.0 International</dc:rights>
   <dc:format>6 p.</dc:format>
   <dc:format>application/pdf</dc:format>
   <dc:publisher>Universidad de Alcalá</dc:publisher>
</oai_dc:dc></metadata></record></GetRecord></OAI-PMH>