Lupa

Show document Help

A- | A+ | Print
Title:Nonuniform lines on finite projective planes
Authors:ID Markó, Ádám (Author)
Files:.pdf ADAM_Marko_2026.pdf (414,61 KB)
MD5: 071A1B3D54B7ED188AC1A76376B11B99
 
Language:English
Work type:Article
Typology:1.01 - Original Scientific Article
Organization:ZUP - University of Primorska Press
Abstract:We consider the stability version of the following problem, originally posed by Erdős: colour the points of a projective plane of order q, q odd, with two colours. What is the minimum number of nonuniform lines, that is the lines on which the number of points of the two colours are not the same. It is easy to show that the number of nonuniform lines is at least q+1 and there is a trivial colouring with q+1 nonuniform lines. Our main result is that the number of nonuniform lines is at least 13/8 * q or we have the trivial colouring.
Keywords:colouring, projective planes, blocking sets
Publication status:Published
Publication version:Version of Record
Publication date:01.12.2025
Publisher:Založba Univerze na Primorskem
Year of publishing:2026
Number of pages:22 str.
Numbering:Vol. 9, no. 1, [article no.] P1.08
PID:20.500.12556/RUP-22823 This link opens in a new window
UDC:51
eISSN:2590-9770
DOI:10.26493/2590-9770.1803.58a This link opens in a new window
Publication date in RUP:20.03.2026
Views:129
Downloads:3
Metadata:XML DC-XML DC-RDF
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share


Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:The Art of Discrete and Applied Mathematics
Publisher:Založba Univerze na Primorskem
ISSN:2590-9770

Licences

License:CC BY 4.0, Creative Commons Attribution 4.0 International
Link:http://creativecommons.org/licenses/by/4.0/
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.

Secondary language

Language:Slovenian
Title:Neenakomerne premice na končnih projektivnih ravninah
Abstract:Obravnavamo stabilnostno različico naslednjega problema, ki ga je prvotno zastavil Erdos: pobarvajmo točke projektivne ravnine reda q, kjer je q liho, z dvema barvama. Kolikšno je najmanjše število neenakomernih premic, torej premic, na katerih število točk posamezne barve ni enako? Pokažemo, da je število neenakomernih premic vsaj q+1, in da obstaja trivialno barvanje z q+1 neenakomernimi premicami. Naš glavni rezultat je, da je število neenakomernih premic vsaj 13/8 * q ali pa je barvanje trivialno.
Keywords:barvanje, projektivne ravnine, blokovne množice


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica