https://hal.inria.fr/hal-00990599Koponen, VeraVeraKoponenDepartment of Mathematics [Uppsala] - Uppsala UniversityRandom graphs with bounded maximum degree: asymptotic structure and a logical limit lawHAL CCSD2012[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]Inria Sophia Antipolis-Méditerranée / I3s, Service Ist2014-05-13 16:27:592017-09-07 01:03:372014-05-13 16:42:54enJournal articleshttps://hal.inria.fr/hal-00990599/document10.46298/dmtcs.592application/pdf1For 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.