Abstrait
Peut-être le plus connu des problèmes sur les configurations de droites futil soulevé par Sylvester, en 1893, dans un recueil de problèmes mathématiques:
QUESTIONS FOB SOLUTION. 11851. (Professor Sylvester.)—Prove that it is not possible to arrange any finite number of real points so that a right line through every two of them shall pass through a third, unless they all lie in the same right line.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Bibliographie
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 (contient la preuve de Kelly).
P. Erdős: Problem 4065-Three point collinearity, Amer.Math. Monthly 51 (1944), 169–171 (contient la preuve de Gallai).
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. Tverberg: On the decomposition of Kn into complete bipartite graphs, J. Graph Theory 6 (1982), 493–494.
Rights and permissions
Copyright information
© 2006 Springer-Verlag France
About this chapter
Cite this chapter
(2006). Droites du plan et décompositions de graphes. In: Raisonnements divins. Springer, Paris. https://doi.org/10.1007/2-287-33846-2_9
Download citation
DOI: https://doi.org/10.1007/2-287-33846-2_9
Publisher Name: Springer, Paris
Print ISBN: 978-2-287-33845-8
Online ISBN: 978-2-287-33846-5