4 papers
On the balanced upper chromatic number of finite projective planes
Zoltán L. Blázsik, Aart Blokhuis, Štefko Miklavič +2
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…
Partition dimension of projective planes
Zoltán Blázsik, Zoltán Lóránt Nagy
We determine the partition dimension of the incidence graph of the projective plane up to a constant factor as $(2+o(1))\log_2{q}\leq \mathrm{pd}(G(Π_q))\leq (4+…
Cospectral regular graphs with and without a perfect matching
Zoltan L. Blazsik, Jay Cummings, Willem H. Haemers
For each we construct a pair of cospectral -regular graphs, where one has a perfect matching and the other one not. This solves a research problem posed by the third…
Maximal Complexity of Finite Words
M-C. Anisiu, Z. Blazsik, Z. Kasa
The subword complexity of a finite word of length is a function which associates to each the number of all distinct subwords of having the length . We defin…