Elad Aigner-Horev

activity

20102026

most citedInfinite matroid union

17 citations · 47 across the 21 of their papers we have counts for

collaborators

Showing 2022Show all

2 papers · 1 filter

math.CO2022

Minors, connectivity, and diameter in randomly perturbed sparse graphs

Elad Aigner-Horev, Dan Hefetz, Michael Krivelevich

Extremal properties of sparse graphs, randomly perturbed by the binomial random graph are considered. It is known that every $n$ -vertex graph $G$ contains a complete minor of order…

math.CO2022

Cycle lengths in randomly perturbed graphs

Elad Aigner-Horev, Dan Hefetz, Michael Krivelevich

Let $G$ be an $n$ -vertex graph, where $δ (G) \geq δ n$ for some $δ := δ (n)$ . A result of Bohman, Frieze and Martin from 2003 asserts that if $α (G) = O (δ^{2} n)$ , then pertu…