Abstract
It is proved, sharpening previous results of Scheinerman and by analysing an algorithm, that the independence number of the random interval graph, defined as the intersection graph of n intervals whose end points are chosen at random on [0,1], concentrates around \( 2\sqrt {\frac{n} {\pi }} \) .
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Scheinerman, E.R., Random Interval Graphs, Combinatorica 8 (1988) 357–371.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de la Vega Fernandez, W. (2000). The Independence Number of Random Interval Graphs. In: Bongiovanni, G., Petreschi, R., Gambosi, G. (eds) Algorithms and Complexity. CIAC 2000. Lecture Notes in Computer Science, vol 1767. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46521-9_5
Download citation
DOI: https://doi.org/10.1007/3-540-46521-9_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67159-6
Online ISBN: 978-3-540-46521-8
eBook Packages: Springer Book Archive