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.
Bibliografia
M. Ajtai, V. Chvátal, M. Newborn & E. Szemerédi: Crossing-free subgraphs, Annals of Discrete Math. 12 (1982), 9–12.
N. Alon & J. Spencer: The Probabilistic Method, Second edition, Wiley-Interscience 2000.
P. Erdős: Some remarks on the theory of graphs, Bulletin Amer. Math. Soc. 53 (1947), 292–294.
P. Erdős: Graph theory and probability, Canadian J. Math. 11 (1959), 34–38.
P. Erdős: On a combinatorial problem I, Nordisk Math. Tidskrift 11 (1963), 5–10.
P. Erdős & R. K. Guy: Crossing number problems, Amer. Math. Monthly 80 (1973), 52–58.
P. Erdős & A. Rényi: On the evolution of random graphs, Magyar Tud. Akad. Mat. Kut. Int. Közl. 5 (1960), 17–61.
T. Leighton: Complexity Issues in VLSI, MIT Press, Cambridge MA 1983.
L. A. Székely: Crossing numbers and hard Erdős problems in discrete geometry, Combinatorics, Probability, and Computing 6 (1997), 353–358.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Italia, Milano
About this chapter
Cite this chapter
(2006). Le probabilità semplificano (talvolta) il contare. In: Quarteroni, A. (eds) Proofs from THE BOOK. Springer, Milano. https://doi.org/10.1007/88-470-0451-9_35
Download citation
DOI: https://doi.org/10.1007/88-470-0451-9_35
Publisher Name: Springer, Milano
Print ISBN: 978-88-470-0435-1
Online ISBN: 978-88-470-0451-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)