Elad Aigner-Horev

activity

20102026

most citedInfinite matroid union

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

collaborators

Showing math.COShow all

24 papers · 1 filter

math.CO2026

Exact-palette rainbow embeddings in uniformly coloured pseudorandom graphs

Elad Aigner-Horev, Dan Hefetz, Yury Person +1

We study rainbow spanning configurations in bijumbled graphs whose edges are coloured independently and uniformly from a prescribed palette. For $n$ -vertex $(p, β)$ -bijumbled graphs…

math.CO2026

Resilience of rainbow Hamilton cycles in pseudorandom graphs

Elad Aigner-Horev, Dan Hefetz, Yury Person

For every fixed $ε \in (0, 1/2)$ , we prove that every spanning subgraph $H$ of an $n$ -vertex $(p, β)$ -bijumbled graph satisfying $δ (H) \geq (1/2 + ε) p n$ contains a rain…

math.CO2026

Rainbow spanning configurations in uniformly coloured pseudorandom graphs

Elad Aigner-Horev, Dan Hefetz, Yury Person +1

We prove a quantitative palette-transference principle for rainbow spanning configurations in uniformly edge-coloured pseudorandom graphs. The input to our transference principle i…

math.CO2023

Ramsey properties of randomly perturbed hypergraphs

Elad Aigner-Horev, Dan Hefetz, Mathias Schacht

We study Ramsey properties of randomly perturbed $3$ -uniform hypergraphs. For~ $t \geq 2$ , write $K ~_{t}^{(3)}$ to denote the $3$ -uniform {\it expanded} clique hypergraph obtaine…

math.CO2023

Smoothed Analysis of the Komlós Conjecture: Rademacher Noise

Elad Aigner-Horev, Dan Hefetz, Michael Trushkin

The {\em discrepancy} of a matrix $M \in R^{d \times n}$ is given by $DISC (M) := min_{x \in {- 1, 1}^{n}} ∥ M x ∥_{\infty}$ . An outstanding…

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…