Exploració per autor "Drmota, Michael"
Ara es mostren els items 1-10 de 10
-
Almost every tree with m edges decomposes K2m,2m
Drmota, Michael; Lladó Sánchez, Ana M. (2014-01)
Article
Accés obertWe show that asymptotically almost surely a tree with m edges decomposes the complete bipartite graph K2m,2m, a result connected to a conjecture of Graham and Häggkvist. The result also implies that asymptotically almost ... -
Asymptotic study of subcritical graph classes
Drmota, Michael; Fusy, Éric; Kang, Mihyun; Kraus, Veronika; Rué Perna, Juan José (2011-12-01)
Article
Accés obertWe present a unified general method for the asymptotic study of graphs from the so-called subcritical graph classes, which include the classes of cacti graphs, outerplanar graphs, and series-parallel graphs. This general ... -
Chordal graphs with bounded tree-width
Castellví Foguet, Jordi; Drmota, Michael; Noy Serrano, Marcos; Requile, Clement (Masaryk University, 2023)
Comunicació de congrés
Accés obertGiven $t\ge 2$ and $0\le k\le t$, we prove that the number of labelled $k$-connected chordal graphs with $n$ vertices and tree-width at most $t$ is asymptotically $c n^{-5/2} \gamma^n n!$, as $n\to\infty$, for some constants ... -
Cut vertices in random planar maps
Drmota, Michael; Noy Serrano, Marcos; Stufler, Benedikt (2023-09-22)
Article
Accés obertThe main goal of this paper is to determine the asymptotic behavior of the number X n of cut-vertices in random planar maps with n edges. It is shown that X n / n ¿ c in probability (for some explicit c > 0 ). For so-called ... -
Maximal independent sets and maximal matchings in series-parallel and related graph classes
Drmota, Michael; Ramos Garrido, Lander; Requilé, Clément; Rué Perna, Juan José (2020-01-10)
Article
Accés obertThe goal of this paper is to obtain quantitative results on the number and on the size of maximal independent sets and maximal matchings in several block-stable graph classes that satisfy a proper sub-criticality condition. ... -
Maximal independent sets and maximal matchings in series-parallel and related graph classes
Drmota, Michael; Ramos, Lander; Requilé, Clément; Rué Perna, Juan José (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018)
Comunicació de congrés
Accés obertWe provide combinatorial decompositions as well as asymptotic tight estimates for two maximal parameters: the number and average size of maximal independent sets and maximal matchings in seriesparallel graphs (and related ... -
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 ... -
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 ... -
The Maximum degree of series-parallel graphs
Drmota, Michael; Giménez Llach, Omer; Noy Serrano, Marcos (2011-07)
Article
Accés restringit per acord de confidencialitatWe prove that the maximum degree Δn of a random series-parallel graph with n vertices satisfies Δn/ log n → c in probability, and EΔn ∼ c log n for a computable constant c > 0. The same kind of result holds for 2-connected ... -
Universal singular exponents in catalytic variable equations
Drmota, Michael; Noy Serrano, Marcos; Yu, Guan-Ru (2021-08-19)
Article
Accés obertCatalytic equations appear in several combinatorial applications, most notably in the enumeration of lattice paths and in the enumeration of planar maps. The main purpose of this paper is to show that the asymptotic estimate ...