4 papers
Crumby colorings -- red-blue vertex partition of subcubic graphs regarding a conjecture of Thomassen
János Barát, Zoltán L. Blázsik, Gábor Damásdi
Thomassen formulated the following conjecture: Every -connected cubic graph has a red-blue vertex coloring such that the blue subgraph has maximum degree at most (that is, i…
Upper bounds for the necklace folding problems
Endre Csóka, Zoltán L. Blázsik, Zoltán Király +1
A necklace can be considered as a cyclic list of red and blue beads in an arbitrary order, and the goal is to fold it into two and find a large cross-free matching of pairs…
On the upper chromatic number and multiplte blocking sets of PG()
Zoltán L. Blázsik, Tamás Héger, Tamás Szőnyi
We investigate the upper chromatic number of the hypergraph formed by the points and the -dimensional subspaces of ; that is, the most number of colors that ca…
Spreading linear triple systems and expander triple systems
Zoltán L. Blázsik, Zoltán Lóránt Nagy
The existence of Steiner triple systems STS(n) of order n containing no nontrivial subsystem is well known for every admissible n. We generalize this result in two ways. First we d…