Elad Aigner-Horev

activity

20102026

most citedInfinite matroid union

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

collaborators

Showing 2026Show all

4 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

We prove that every spanning subgraph $H$ of an $n$ -vertex $(p, β)$ -bijumbled graph, satisfying $δ (H) \geq (1/2 + ε) p n$ , where $ε > 0$ is arbitrarily small yet fixed…

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…

cs.LG2026

The Sample Complexity of Distributionally Robust PAC Learning under Cressie--Read Divergences

Elad Aigner-Horev, Daniel Rosenberg, Roi Weiss

We study distributionally robust PAC learning for the $0$ -- $1$ -loss, where adversarial perturbations of the data distribution are constrained by a Cressie--Read divergence of order…