Liam Hardiman

activity

20212025

collaborators

4 papers

cs.DS2025

Improved Sublinear Algorithms for Classical and Quantum Graph Coloring

Asaf Ferber, Liam Hardiman, Xiaonan Chen

We present three sublinear randomized algorithms for vertex-coloring of graphs with maximum degree $Δ$ . The first is a simple algorithm that extends the idea of Morris and Song to…

quant-ph2024

A quantum algorithm for learning a graph of bounded degree

Asaf Ferber, Liam Hardiman

We are presented with a graph, $G$ , on $n$ vertices with $m$ edges whose edge set is unknown. Our goal is to learn the edges of $G$ with as few queries to an oracle as possible. Wh…

math.CO2021

Counting Hamiltonian Cycles in Dirac Hypergraphs

Asaf Ferber, Liam Hardiman, Adva Mond

For $0 \leq ℓ < k$ , a Hamiltonian $ℓ$ -cycle in a $k$ -uniform hypergraph $H$ is a cyclic ordering of the vertices of $H$ in which the edges are segments of length $k$ and every…

math.CO2021

On subgraphs with degrees of prescribed residues in the random graph

Asaf Ferber, Liam Hardiman, Michael Krivelevich

We show that with high probability the random graph $G_{n, 1/2}$ has an induced subgraph of linear size, all of whose degrees are congruent to $r (mod q)$ for any fixed $r$ and $q\g…