On the balanced upper chromatic number of finite projective planes
Blázsik, Zoltán L. ...
In this paper, we study vertex colorings of hypergraphs in which all color class sizes differ by at most one (balanced colorings) and each hyperedge contains at least two vertices of the same color ...(rainbow-free colorings). For any hypergraph ▫$H$▫, the maximum number ▫$k$▫ for which there is a balanced rainbow-free ▫$k$▫-coloring of ▫$H$▫ is called the balanced upper chromatic number of the hypergraph. We confirm the conjecture of G. Araujo-Pardo et al. [ibid. 338, No. 12, 2562--2571 (2015)] by determining the balanced upper chromatic number of the desarguesian projective plane ▫$\operatorname{PG} ( 2 , q )$▫ for all ▫$q$▫. In addition, we determine asymptotically the balanced upper chromatic number of several families of non-desarguesian projective planes and also provide a general lower bound for arbitrary projective planes using probabilistic methods which determines the parameter up to a multiplicative constant.
It was not necessary to add the material to the shelf.
Bibliographic material was successfully added on shelf.
Adding bibliographical material on shelf was not successful.
Material is already on the shelf.
Permalink
URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year
Impact factor
Edition
Category
Classification
JCR
SNIP
JCR
SNIP
JCR
SNIP
JCR
SNIP
Select the library membership card:
DRS,
in which the journal is indexed
Database name
Field
Year
Links to authors' personal bibliographies
Links to information on researchers in the SICRIS system
Subject headings in COBISS General List of Subject Headings
Select pickup location
The material from the parent unit is free. If the material is delivered to the pickup location from another unit, the library may charge you for this service.
PDF
