Random graphs with bounded maximum degree: asymptotic structure and a logical limit law - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 2012

Random graphs with bounded maximum degree: asymptotic structure and a logical limit law

Résumé

For any fixed integer R≥2 we characterise the typical structure of undirected graphs with vertices 1,...,n and maximum degree R, as n tends to infinity. The information is used to prove that such graphs satisfy a labelled limit law for first-order logic. If R≥5 then also an unlabelled limit law holds.
Fichier principal
Vignette du fichier
2120-7552-5-PB.pdf (376.87 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00990599 , version 1 (13-05-2014)

Identifiants

Citer

Vera Koponen. Random graphs with bounded maximum degree: asymptotic structure and a logical limit law. Discrete Mathematics and Theoretical Computer Science, 2012, Vol. 14 no. 2 (2), pp.229--254. ⟨10.46298/dmtcs.592⟩. ⟨hal-00990599⟩

Collections

TDS-MACS
51 Consultations
800 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More