Exploració per autor "Noy Serrano, Marcos"
Ara es mostren els items 32-51 de 56
-
Geometric tree graphs of points in convex position
(1997)
Article
Accés obertGiven a set $P$ of points in the plane, the geometric tree graph of $P$ is defined as the graph $T(P)$ whose vertices are non-crossing rectilinear spanning trees of $P$, and where two trees $T_1$ and $T_2$ are adjacent ... -
Graph classes with given 3-connected components: asymptotic counting, limit laws and critical phenomena
(Edicions de la Universitat de Lleida (UdL), 2008)
Comunicació de congrés
Accés restringit per política de l'editorialConsider a family T of 3-connected graphs, and let G be the class of graphs whose 3-connected components are graphs in T . We present a general framework for analyzing such graphs classes based on singularity analysis of ... -
Graphs of non-crossing perfect matchings
(2001)
Article
Accés obertLet Pn be a set of n = 2m points that are the vertices of a convex polygon, and let Mm be the graph having as vertices all the perfect matchings in the point set Pn whose edges are straight line segments and do not cross, ... -
Identities for non-crossing graphs and multigraphs
(2008-12)
Article
Accés restringit per política de l'editorialWe refine an identity between the numbers of certain non-crossing graphs and multigraphs, by modifying a bijection found by P. Podbrdský [A bijective proof of an identity for noncrossing graphs, Discrete Math. 260 (2003) ... -
Isolated cycles of critical random graphs
(Society for Industrial and Applied Mathematics (SIAM), 2017)
Text en actes de congrés
Accés obertConsider the Erdos-Renyi random graph G(n, M) built with n vertices and M edges uniformly randomly chosen from the set of n2 edges. Let L be a set of positive integers. For any number of edges M 6n/2 + O(n 2/3 ), we compute ... -
Limiting probabilities of first order properties of random sparse graphs and hypergraphs
(2021-08-18)
Article
Accés obertLet Gn be the binomial random graph G(n, p = c/n) in the sparse regime, which as is well-known undergoes a phase transition at c = 1. Lynch (Random Structures Algorithms, 1992) showed that for every first order sentence ... -
On matroids determined by their Tutte polynomials
(2005)
Article
Accés restringit per política de l'editorialA matroid is T-unique if it is determined up to isomorphism by its Tutte polynomial. Known T-unique matroids include projective and affine geometries of rank at least four, wheels, whirls, free and binary spikes, and certain ... -
On the diameter of random planar graphs
(2015)
Article
Accés obertWe show that the diameter diam(Gn) of a random labelled connected planar graph with n vertices is equal to n1/4+o(1) , in probability. More precisely, there exists a constant c > 0 such that {equation presented} for ˜ small ... -
On the evaluation of the Tutte polynomial at the points (1,-1) and (2,-1)
(2010)
Text en actes de congrés
Accés obertC. Merino proved recently the following identity between evaluations of the Tutte polynomial of complete graphs: t($K_{n+2}$; 1,−1) = t($K_n$;2,−1). In this work we extend this result by giving a large class of graphs with ... -
On the expected number of perfect matchings in cubic planar graphs
(2022-01-01)
Article
Accés obertA well-known conjecture by Lovász and Plummer from the 1970s asserted that a bridgeless cubic graph has exponentially many perfect matchings. It was solved in the affirmative by Esperet et al. (Adv. Math. 2011). On the ... -
On the maximum number of cycles in outerplanar and series-parallel graph
(2009)
Article
Accés restringit per política de l'editorialLet c(n) be the maximum number of cycles in an outerplanar graph with n vertices. We show that lim $c(n)^{1/n}$ exists and equals β = 1.502837 . . ., where β is a constant related to the recurrence $x_n+1$=1+$x^2_n$, ... -
On the number of labeled graphs of bounded treewidth
(2018-06-01)
Article
Accés obertLet be Tnk the number of labeled graphs on vertices and treewidth at most (equivalently, the number o<f labeled partial -trees). We show that [...] for k>1 and some explicit absolute constant c>0. Disregarding terms depending ... -
On the probability of planarity of a random graph near the critical point
(2015-03-01)
Article
Accés obertLet G(n, M) be the uniform random graph with n vertices and M edges. Erdos and Renyi (1960) conjectured that the limiting probability; lim(n ->infinity) Pr{G(n, n/2) is planar}; exists and is a constant strictly between 0 ... -
On zero-one and convergence laws for graphs embeddable on a fixed surface
(Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018)
Text en actes de congrés
Accés obertWe show that for no surface except for the plane does monadic second-order logic (MSO) have a zero-one-law - and not even a convergence law - on the class of (connected) graphs embeddable on the surface. In addition we ... -
Perspectivas en combinatoria
(Real Sociedad Matemática Española, 2016-10-03)
Article
Accés obert -
Random cubic planar graphs revisited
(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
(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
(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 planar maps and graphs with minimum degree two and three
(2018-10-05)
Article
Accés obertWe find precise asymptotic estimates for the number of planar maps and graphs with a condition on the minimum degree, and properties of random graphs from these classes. In particular we show that the size of the largest ... -
TEORIA DE LA PROBABILITAT | FINAL
(Universitat Politècnica de Catalunya, 2024-01-15)
Examen
Accés restringit a la comunitat UPC
