On the Independence Number of Random Interval Graphs

DOI10.1017/S0963548301004813zbMath0999.60024WikidataQ58374476 ScholiaQ58374476MaRDI QIDQ2777890

Stéphane Boucheron, Wenceslas Fernandez de la Vega

Publication date: 17 September 2002

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

greedy algorithmcentral limit theoremlarge deviation principlefirst-passage times

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80)

Related Items (3)

The Temp Secretary Problem ⋮ Long-range last-passage percolation on the line ⋮ Generalised online colouring problems in overlap graphs

This page was built for publication: On the Independence Number of Random Interval Graphs