Abstract
One of our results: Let ℙ denote a finite projective plane of ordern. Colour its vertices byχ colours. If no colour appears more than twice on any of the lines, thenχ ≥ n + 1. Explicit constructions show that this bound is sharp when ℙ is desarguesian.
Similar content being viewed by others
References
Bose, R.C.: Mathematical theory of the symmetrical factorial design. Sankhyā8, 107–166 (1947)
deBruijin, N.G., Erdös, P.: On a combinatorial problem. Indagationes Math.10, 421–423 (1948)
Bruck, R.H.: Quadric extensions of cyclic planes. Proc. Symp. Appl. Math.X, 15–44. (1960)
Boros, E., Szönyi, T.: On the sharpness of a theorem of B. Segre, Combinatorica (to appear)
Csima, J.: Colouring finite planes of odd order. Discrete Math.49, 309 (1984)
Erdös, P., Sós, V.T.: unpublished.
Füredi, Z., Rosenberg, I.G.: Multicolored lines in a finite geometry. Discrete Math., submitted.
Kabell, J.A.: A note on colorings of finite planes. Discrete Math.44, 319–320 (1983)
Lidl, R., Niederreider, H.: Finite Fields. pp. 278–289. Reading: Addison-Wesley 1983
Meshulam, R.: On multicolored lines in a linear space. J. Comb. Theory (A)40, 150–155 (1985)
Singer, J.: A theorem in finite projective geometry and some applications to number theory. Trans. Amer. Math. Soc.43, 377–385 (1938)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Csima, J., Füredi, Z. Colouring finite incidence structures. Graphs and Combinatorics 2, 339–346 (1986). https://doi.org/10.1007/BF01788107
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01788107