Zoltán L. Blázsik

activity

20102024

collaborators

6 papers

math.CO2024

The connection between the chromatic numbers of a hypergraph and its $1$ -intersection graph

Zoltán L. Blázsik, Nathan W. Lemons

A well known problem from an excellent book of Lovász states that any hypergraph with the property that no pair of hyperedges intersect in exactly one vertex can be properly 2-colo…

math.CO2023

Improved upper bound on the Frank number of $3$ -edge-connected graphs

János Barát, Zoltán L. Blázsik

In an orientation $O$ of the graph $G$ , an arc $e$ is deletable if and only if $O - e$ is strongly connected. For a $3$ -edge-connected graph $G$ , the Frank number is the minimum $k$ …

math.CO2023

General sharp upper bounds on the total coalition number

János Barát, Zoltán L. Blázsik

Let $G (V, E)$ be a finite, simple, isolate-free graph. Two disjoint sets $A, B \subset V$ form a total coalition in $G$ , if none of them is a total dominating set, but their union $A\…

math.CO2016

Partition dimension of projective planes

Zoltán Blázsik, Zoltán Lóránt Nagy

We determine the partition dimension of the incidence graph $G (Π_{q})$ of the projective plane $Π_{q}$ up to a constant factor $2$ as $(2+o(1))\log_2{q}\leq \mathrm{pd}(G(Π_q))\leq (4+…

math.CO2014

Cospectral regular graphs with and without a perfect matching

Zoltan L. Blazsik, Jay Cummings, Willem H. Haemers

For each $b \geq 5$ we construct a pair of cospectral $b$ -regular graphs, where one has a perfect matching and the other one not. This solves a research problem posed by the third…

cs.DM2010

Maximal Complexity of Finite Words

M-C. Anisiu, Z. Blazsik, Z. Kasa

The subword complexity of a finite word $w$ of length $N$ is a function which associates to each $n \leq N$ the number of all distinct subwords of $w$ having the length $n$ . We defin…