Random planar maps and graphs with minimum degree two and three

Home | About RECERCAT | Contact

Català | Castellano

All of RECERCAT

By Communities &
Collections By Defense Date By Authors By Titles By Subject

This Collection

By Defense Date By Authors By Titles By Subject

Statistics

View Statistics All RECERCAT

My RECERCAT

Other repositories directory

RECERCAT Home > Universitat Politècnica de Catalunya > Documents de recerca > View document

To access the full text documents, please follow this link: http://hdl.handle.net/2117/130669

dc.contributor	Universitat Politècnica de Catalunya. Departament de Matemàtiques
dc.contributor	Universitat Politècnica de Catalunya. GAPCOMB - Geometric, Algebraic and Probabilistic Combinatorics
dc.contributor.author	Noy Serrano, Marcos
dc.contributor.author	Ramos, Lander
dc.date	2018-10-05
dc.identifier.citation	Noy, M.; Ramos, L. Random planar maps and graphs with minimum degree two and three. "Electronic journal of combinatorics", 5 Octubre 2018, vol. 25, núm. 4, p. 1-38.
dc.identifier.citation	1077-8926
dc.identifier.uri	http://hdl.handle.net/2117/130669
dc.language.iso	eng
dc.relation	https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i4p5/pdf
dc.relation	info:eu-repo/grantAgreement/ES/2PE/MDM-2014-0445
dc.relation	info:eu-repo/grantAgreement/ES/2PE/MTM2014-54745-P
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights	info:eu-repo/semantics/openAccess
dc.rights	http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subject	Àrees temàtiques de la UPC::Matemàtiques i estadística
dc.subject	Combinatorics
dc.subject	Graph theory
dc.subject	Classificació AMS::05 Combinatorics
dc.title	Random planar maps and graphs with minimum degree two and three
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	info:eu-repo/semantics/article
dc.description.abstract	We 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 tree attached to the core of a random planar graph is of order c log(n) for an explicit constant c. These results provide new information on the structure of random planar graphs.
dc.description.abstract	Peer Reviewed

Show simple item record

All of RECERCAT

This Collection

Statistics

My RECERCAT

Related documents

Other documents of the same author