On the tree depth of random graphs

All of RECERCAT

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

dc.contributor	Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV
dc.contributor	Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
dc.contributor.author	Perarnau Llobet, Guillem
dc.contributor.author	Serra Albó, Oriol
dc.date	2010
dc.identifier.citation	Perarnau-Llobet, G.; Serra, O. On the tree depth of random graphs. A: VII Jornadas de Matemática Discreta y Algorítmica. "VII Jornadas de Matemática Discreta y Algorítmica". Castro Urdiales: 2010, p. 517-529.
dc.identifier.citation	978-84-693-3063-0
dc.identifier.uri	http://hdl.handle.net/2117/11262
dc.language.iso	eng
dc.relation	http://www.jmda2010.unican.es/Librodeactas.pdf
dc.rights	info:eu-repo/semantics/openAccess
dc.subject	Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs
dc.subject	Random graphs
dc.subject	Graph theory
dc.subject	Mathematical models
dc.subject	Grafs, Teoria de
dc.subject	Models matemàtics
dc.title	On the tree depth of random graphs
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	info:eu-repo/semantics/conferenceObject
dc.description.abstract	The tree-depth of a graph G is a parameter that plays a crucial role in the theory of bounded expansion classes and has been introduced under numerous names. We describe the asymptotic behaviour of this parameter in the case of dense and of sparse random graphs. The results also provide analogous descriptions for the tree-width of random graphs.