8 citations · 10 across the 4 of their papers we have counts for
5 papers · 1 filter
Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic
Jesse Campion Loth, Kevin Halasz, Tomáš Masařík +2
A random 2-cell embedding of a connected graph in some orientable surface is obtained by choosing a random local rotation around each vertex. Under this setup, the number of fa…
From one to many rainbow Hamiltonian cycles
Peter Bradshaw, Kevin Halasz, Ladislav Stacho
Given a graph and a family of subgraphs of , a transversal of is a pair such that and $ϕ: T \righ…
Random 2-cell embeddings of multistars
Jesse Campion Loth, Kevin Halasz, Tomáš Masařík +2
Random 2-cell embeddings of a given graph are obtained by choosing a random local rotation around every vertex. We analyze the expected number of faces, , of s…
All group-based latin squares possess near transversals
Luis Goddyn, Kevin Halasz
In a latin square of order , a near transversal is a collection of cells which intersects each row, column, and symbol class at most once. A longstanding conjecture of Bru…
The Chromatic Number of Finite Group Cayley Tables
Luis Goddyn, Kevin Halasz, E. S. Mahmoodian
The chromatic number of a latin square , denoted , is the minimum number of partial transversals needed to cover all of its cells. It has been conjectured that every latin…