David Munhá Correia

collaborators

2 papers

math.CO2025

Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions

Nemanja DraganiÄ, Jaehoon Kim, Hyunwoo Lee +3

Dirac's classical theorem asserts that, for $n \geq 3$ , any $n$ -vertex graph with minimum degree at least $n /2$ is Hamiltonian. Furthermore, if we additionally assume that such grap…

cs.CC2024

Small Even Covers, Locally Decodable Codes and Restricted Subgraphs of Edge-Colored Kikuchi Graphs

Jun-Ting Hsieh, Pravesh K. Kothari, Sidhanth Mohanty +2

Given a $k$ -uniform hypergraph $H$ on $n$ vertices, an even cover in $H$ is a collection of hyperedges that touch each vertex an even number of times. Even covers are a generalizat…