Abstract
The notion of quasirandom graphs has received much attention in the last decades. The idea is that a graph need only satisfy certain properties. With these properties a graph will share many other properties with suitably defined random graphs. This very general idea applies to many other structures, but here we restrict ourselves to graphs, without direction, loops, or multiple edges.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
F. Chung, R. Graham and R. Wilson, Quasi-random graphs, Combinatorica, vol. 9 (1989), 345–362.
L. Lovász and V. Sós, Generalized Quasirandom Graphs, J. Combinatorial Theory (B), vol. 98 (2008), 146–163.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 János Bolyai Mathematical Society and Springer-Verlag
About this chapter
Cite this chapter
Spencer, J. (2010). Quasirandom Multitype Graphs. In: Bárány, I., Solymosi, J., Sági, G. (eds) An Irregular Mind. Bolyai Society Mathematical Studies, vol 21. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14444-8_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-14444-8_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14443-1
Online ISBN: 978-3-642-14444-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)