On connectivity in random graph models with limited dependencies

DOI10.4230/LIPICS.APPROX/RANDOM.2023.30MaRDI QIDQ6663045FDOQ6663045

Authors: Johannes Lengler, Anders Martinsson, Kalina Petrova, Patrick Schnider, Raphael Steiner, Simon Weber, Emo Welzl 

Publication date: 14 January 2025

zbMATH Keywords

thresholdindependenceconnectivityrandom graphsprobabilistic methoddependency

Mathematics Subject Classification ID

Randomized algorithms (68W20) Combinatorial optimization (90C27) Approximation algorithms (68W25)

This page was built for publication: On connectivity in random graph models with limited dependencies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6663045)