Kevin Halasz

activity

20182021

collaborators

3 papers

math.CO2021

From one to many rainbow Hamiltonian cycles

Peter Bradshaw, Kevin Halasz, Ladislav Stacho

Given a graph $G$ and a family $G = {G_{1}, \dots, G_{n}}$ of subgraphs of $G$ , a transversal of $G$ is a pair $(T, ϕ)$ such that $T \subseteq E (G)$ and $ϕ: T \righ…

math.CO2019

All group-based latin squares possess near transversals

Luis Goddyn, Kevin Halasz

In a latin square of order $n$ , a near transversal is a collection of $n - 1$ cells which intersects each row, column, and symbol class at most once. A longstanding conjecture of Bru…

math.CO2018

The Chromatic Number of Finite Group Cayley Tables

Luis Goddyn, Kevin Halasz, E. S. Mahmoodian

The chromatic number of a latin square $L$ , denoted $χ (L)$ , is the minimum number of partial transversals needed to cover all of its cells. It has been conjectured that every latin…