Ethan Honest

collaborators

2 papers

math.CO2026

NP-Hardness of the $H$ -Free Edge-Deletion Problem

Lior Gishboliner, Ethan Honest

For a graph $H$ , the $H$ -freeness edge-deletion problem is the algorithmic problem of finding, for an input graph $G$ , the minimum number of edges of $G$ whose deletion turns $G$ i…

math.CO2025

Disperse Hypergraphs

Lior Gishboliner, Ethan Honest

For $ℓ \geq 3$ , an $ℓ$ -uniform hypergraph is disperse if the number of edges induced by any set of $ℓ + 1$ vertices is 0, 1, $ℓ$ or $ℓ + 1$ . We show that every disperse…

NP-Hardness of the H-Free Edge-Deletion Problem

Disperse Hypergraphs

NP-Hardness of the $H$ -Free Edge-Deletion Problem