David Munhá Correia

activity

20212025

most citedHamiltonicity of expanders: optimal bounds and applications

1 citations · 2 across the 7 of their papers we have counts for

collaborators

Showing 2024Show all

2 papers · 1 filter

math.CO2024★ 1 cited

Hamiltonicity of expanders: optimal bounds and applications

Nemanja Draganić, Richard Montgomery, David Munhá Correia +2

An $n$ -vertex graph $G$ is a $C$ -expander if $∣ N (X) ∣ \geq C ∣ X ∣$ for every $X \subseteq V (G)$ with $∣ X ∣ < n /2 C$ and there is an edge between every two disjoint sets of at least $n /2 C$ …

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…