Legitimate colorings of projective planes

N. Alon, Z. Füredi

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

For a projective plane ℙn of order n, let κ{script}(ℙn) denote the minimum number k, so that there is a coloring of the points of ℙn in k colors such that no two distinct lines contain precisely the same number of points of each color. Answering a question of A. Rosa, we show that for all sufficiently large n, 5 ≤κ{script}(ℙn) ≤ 8 for every projective plane ℙn of order n.

Original languageEnglish
Pages (from-to)95-106
Number of pages12
JournalGraphs and Combinatorics
Volume5
Issue number1
DOIs
Publication statusPublished - Dec 1989

Fingerprint

Coloring
Projective plane
Colouring
Color
Denote
Distinct
Line

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Mathematics(all)

Cite this

Legitimate colorings of projective planes. / Alon, N.; Füredi, Z.

In: Graphs and Combinatorics, Vol. 5, No. 1, 12.1989, p. 95-106.

Research output: Contribution to journalArticle

@article{16f40e438b6d4f179660b9e1e4045b40,
title = "Legitimate colorings of projective planes",
abstract = "For a projective plane ℙn of order n, let κ{script}(ℙn) denote the minimum number k, so that there is a coloring of the points of ℙn in k colors such that no two distinct lines contain precisely the same number of points of each color. Answering a question of A. Rosa, we show that for all sufficiently large n, 5 ≤κ{script}(ℙn) ≤ 8 for every projective plane ℙn of order n.",
author = "N. Alon and Z. F{\"u}redi",
year = "1989",
month = "12",
doi = "10.1007/BF01788662",
language = "English",
volume = "5",
pages = "95--106",
journal = "Graphs and Combinatorics",
issn = "0911-0119",
publisher = "Springer Japan",
number = "1",

}

TY - JOUR

T1 - Legitimate colorings of projective planes

AU - Alon, N.

AU - Füredi, Z.

PY - 1989/12

Y1 - 1989/12

N2 - For a projective plane ℙn of order n, let κ{script}(ℙn) denote the minimum number k, so that there is a coloring of the points of ℙn in k colors such that no two distinct lines contain precisely the same number of points of each color. Answering a question of A. Rosa, we show that for all sufficiently large n, 5 ≤κ{script}(ℙn) ≤ 8 for every projective plane ℙn of order n.

AB - For a projective plane ℙn of order n, let κ{script}(ℙn) denote the minimum number k, so that there is a coloring of the points of ℙn in k colors such that no two distinct lines contain precisely the same number of points of each color. Answering a question of A. Rosa, we show that for all sufficiently large n, 5 ≤κ{script}(ℙn) ≤ 8 for every projective plane ℙn of order n.

UR - http://www.scopus.com/inward/record.url?scp=0040701229&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0040701229&partnerID=8YFLogxK

U2 - 10.1007/BF01788662

DO - 10.1007/BF01788662

M3 - Article

AN - SCOPUS:0040701229

VL - 5

SP - 95

EP - 106

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

SN - 0911-0119

IS - 1

ER -