Mikl'os Ruszink'o

collaborators

2 papers

math.CO2025

A complete dichotomy theorem on the sparse $t$ -Uniform Hypergraphicality Problem

István Miklós, Miklós Ruszinkó, Bogdán Zavalnij

We prove a complete dichotomy theorem for the parameterized sparse $t$ -uniform hypergraphic degree sequence problem, $\mathrm{sparse}\text{-}t\text{-}\mathrm{uni}\text{-}\mathrm{HD…

math.CO2024

B-colorings of planar and outerplanar graphs

Ryan R. Martin, Miklós Ruszinkó, Gábor N. Sárközy

A coloring of the edges of a graph $G$ in which every $K_{1, 2}$ is totally multicolored is known as a proper coloring and a coloring of the edges of $G$ in which every $K_{1, 2}$ an…

A complete dichotomy theorem on the sparse t-Uniform Hypergraphicality Problem

B-colorings of planar and outerplanar graphs

A complete dichotomy theorem on the sparse $t$ -Uniform Hypergraphicality Problem