Abstract
Perhaps the best-known problem on configurations of lines was raised by Sylvester in 1893 in a column of mathematical problems.
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
N. G. de Bruijn & P. Erdős: On a combinatorial problem, Proc. Kon. Ned. Akad. Wetensch. 51 (1948), 1277–1279.
H. S. M. Coxeter: A problem of collinear points, Amer. Math. Monthly 55 (1948), 26–28 (contains Kelly’s proof).
P. Erdős: Problem 4065 — Three point collinearity, Amer. Math. Monthly 51 (1944), 169–171 (contains Gallai’s proof).
R. L. Graham & H. O. Pollak: On the addressing problem for loop switching, Bell System Tech. J. 50 (1971), 2495–2519.
J. J. Sylvester: Mathematical Question 11851, The Educational Times 46 (1893), 156.
H. T. Verberg: On the decomposition of K n into complete bipartite graphs, J. Graph Theory 6 (1982), 493–494.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Aigner, M., Ziegler, G.M. (2001). Lines in the plane and decompositions of graphs. In: Proofs from THE BOOK. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04315-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-662-04315-8_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-04317-2
Online ISBN: 978-3-662-04315-8
eBook Packages: Springer Book Archive