Exploració per autor "Rué Perna, Juan José"
Ara es mostren els items 67-86 de 90
-
Pentagonal chains and annuli as models for designing nanostructures from cages
Rosenfeld, Vladimir; Dubrynin, Andrey; Oliva, Josep Ma; Rué Perna, Juan José (2016-03-01)
Article
Accés obertCarbon is the most versatile of chemical elements in combining with itself or other elements to form chains, rings, sheets, cages, and periodic 3D structures. One of the perspective trends for creating new molecules of ... -
Product-free sets in the free group
Ortega Sánchez Colomer, Miquel; Rué Perna, Juan José; Serra Albó, Oriol (2023)
Comunicació de congrés
Accés obertWe prove that product-free sets of the free group over a finite alphabet have max-imum density1/2with respect to the natural measure that assigns total weight oneto each set of irreducible words of a given length. This ... -
Random cubic planar graphs revisited
Rué Perna, Juan José; Noy Serrano, Marcos; Requile, Clement (Elsevier, 2016)
Altres
Accés restringit per política de l'editorialThe goal of our work is to analyze random cubic planar graphs according to the uniform distribution. More precisely, let G be the class of labelled cubic planar graphs and let gn be the number of graphs with n vertices. ... -
Random cubic planar graphs revisited
Noy Serrano, Marcos; Requile, Clement; Rué Perna, Juan José (2016-10-18)
Article
Accés obertThe goal of our work is to analyze random cubic planar graphs according to the uniform distribution. More precisely, let G be the class of labelled cubic planar graphs and let gn be the number of graphs with n vertices -
Random cubic planar maps
Drmota, Michael; Noy Serrano, Marcos; Requile, Clement; Rué Perna, Juan José (2023-06-30)
Article
Accés obertWe analyse uniform random cubic rooted planar maps and obtain limiting distributions for several parameters of interest. From the enumerative point of view, we present a unified approach for the enumeration of several ... -
Random strategies are nearly optimal for generalized van der Waerden Games
Kusch, C.; Rué Perna, Juan José; Spiegel, Christoph; Szabó, T. (2017-08-01)
Article
Accés obertIn a (1 : q) Maker-Breaker game, one of the central questions is to find (or at least estimate) the maximal value of q that allows Maker to win the game. Based on the ideas of Bednarska and Luczak [Bednarska, M., and T. ... -
Spanning trees in random series-parallel graphs
Rué Perna, Juan José; Ehrenmüller, Julia (2016-04-01)
Article
Accés obertBy means of analytic techniques we show that the expected number of spanning trees in a connected labelled series-parallel graph on n vertices chosen uniformly at random satisfies an estimate of the form s%-n(1 + o(1)), ... -
Structure and enumeration of K4-minor-free links and link diagrams
Rué Perna, Juan José; Thilikos Touloupas, Dimitrios; Velona, Vasiliki (2018-07-01)
Article
Accés obertWe study the class L of link-types that admit a K4-minor-free diagram, i.e., they can be projected on the plane so that the resulting graph does not contain any subdivision of K4. We prove that L is the closure of a subclass ... -
Structure and enumeration of K4-minor-free links and link-diagrams
Rué Perna, Juan José; Thilikos Touloupas, Dimitrios; Velona, Vasiliki (2020-10-01)
Article
Accés obertWe study the class of link-types that admit a -minor-free diagram, i.e., they can be projected on the plane so that the resulting graph does not contain any subdivision of . We prove that is the closure of a subclass of ... -
Subgraph statistics in subcritical graph classes
Drmota, Michael; Ramos Garrido, Lander; Rué Perna, Juan José (2017-04-01)
Article
Accés obertLet H be a fixed graph and math formula a subcritical graph class. In this paper we show that the number of occurrences of H (as a subgraph) in a graph in math formula of order n, chosen uniformly at random, follows a ... -
TEORIA DE LA PROBABILITAT
Rué Perna, Juan José (Universitat Politècnica de Catalunya, 2018-07-03)
Examen
Accés restringit a la comunitat UPC -
TEORIA DE LA PROBABILITAT | ( Examen extraordinari )
Rué Perna, Juan José (Universitat Politècnica de Catalunya, 2019-07-05)
Examen
Accés restringit a la comunitat UPC -
TEORIA DE LA PROBABILITAT | ( Examen final )
Rué Perna, Juan José (Universitat Politècnica de Catalunya, 2019-01-07)
Examen
Accés restringit a la comunitat UPC -
TEORIA DE LA PROBABILITAT | ( Examen parcial )
Rué Perna, Juan José (Universitat Politècnica de Catalunya, 2018-11-06)
Examen
Accés restringit a la comunitat UPC -
TEORIA DE LA PROBABILITAT | EXTRAORDINARI
Rué Perna, Juan José (Universitat Politècnica de Catalunya, 2020-07-03)
Examen
Accés restringit a la comunitat UPC -
TEORIA DE LA PROBABILITAT | Final
Rué Perna, Juan José (Universitat Politècnica de Catalunya, 2020-01-08)
Examen
Accés restringit a la comunitat UPC -
TEORIA DE LA PROBABILITAT | Parcial
Rué Perna, Juan José (Universitat Politècnica de Catalunya, 2019-11-07)
Examen
Accés restringit a la comunitat UPC -
TEORÍA DE LA PROBABILITAT
Rué Perna, Juan José (Universitat Politècnica de Catalunya, 2017-11-07)
Examen
Accés restringit a la comunitat UPC -
TEORÍA DE LA PROBABILITAT
Rué Perna, Juan José (Universitat Politècnica de Catalunya, 2018-01-15)
Examen
Accés restringit a la comunitat UPC -
The expected number of perfect matchings in cubic planar graphs
Rué Perna, Juan José; Requile, Clement; Noy Serrano, Marcos (Birkhäuser, 2021-09-01)
Capítol de llibre
Accés restringit per política de l'editorialA well-known conjecture by Lovász and Plummer from the 1970s asserting that a bridgeless cubic graph has exponentially many perfect matchings was solved in the affirmative by Esperet et al. (Adv. Math. 2011). On the other ...