Elad Aigner-Horev

According to our database, Elad Aigner-Horev authored at least 28 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Resilience of the quadratic Littlewood-Offord problem.

Elad Aigner-Horev, Daniel Rozenberg, Roi Weiss

CoRR, 2024

Ramsey Properties of Randomly Perturbed Hypergraphs.

Elad Aigner-Horev, Dan Hefetz, Mathias Schacht

Proceedings of the Approximation, 2024

2023

Cycle lengths in randomly perturbed graphs.

Elad Aigner-Horev, Dan Hefetz, Michael Krivelevich

Random Struct. Algorithms, December, 2023

Rainbow trees in uniformly edge-colored graphs.

Elad Aigner-Horev, Dan Hefetz, Abhiruk Lahiri

Random Struct. Algorithms, March, 2023

An asymmetric random Rado theorem: 1-statement.

Elad Aigner-Horev, Yury Person

J. Comb. Theory A, 2023

Smoothed Analysis of the Komlós Conjecture: Rademacher Noise.

Elad Aigner-Horev, Dan Hefetz, Michael Trushkin

CoRR, 2023

2022

Large Rainbow Cliques in Randomly Perturbed Dense Graphs.

Elad Aigner-Horev, Oran Danon, Dan Hefetz, Shoham Letzter

SIAM J. Discret. Math., December, 2022

Envy-free matchings in bipartite graphs and their applications to fair division.

Elad Aigner-Horev, Erel Segal-Halevi

Inf. Sci., 2022

Small rainbow cliques in randomly perturbed dense graphs.

Elad Aigner-Horev, Oran Danon, Dan Hefetz, Shoham Letzter

Eur. J. Comb., 2022

On sparse random combinatorial matrices.

Elad Aigner-Horev, Yury Person

Discret. Math., 2022

2021

Rainbow Hamilton Cycles in Randomly Colored Randomly Perturbed Dense Graphs.

Elad Aigner-Horev, Dan Hefetz

SIAM J. Discret. Math., 2021

Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs.

Elad Aigner-Horev, Gil Levy

Comb. Probab. Comput., 2021

2019

Monochromatic Schur Triples in Randomly Perturbed Dense Sets of Integers.

Elad Aigner-Horev, Yury Person

SIAM J. Discret. Math., 2019

2018

On the intersection of infinite matroids.

Elad Aigner-Horev, Johannes Carmesin, Jan-Oliver Fröhlich

Discret. Math., 2018

2017

Linear quasi-randomness of subsets of abelian groups and hypergraphs.

Elad Aigner-Horev, Hiêp Hàn

Electron. Notes Discret. Math., 2017

Quasirandomness in hypergraphs.

Elad Aigner-Horev, David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht

Electron. Notes Discret. Math., 2017

2016

The structure of 2-separations of infinite matroids.

Elad Aigner-Horev, Reinhard Diestel, Luke Postle

J. Comb. Theory B, 2016

2015

Arithmetic progressions with a pseudorandom step.

Elad Aigner-Horev, Hiêp Hàn

Electron. Notes Discret. Math., 2015

2013

On <i>r</i>-Connected Graphs with No Semi-topological <i>r</i>-Wheel.

Elad Horev, Michael Lomonosov

J. Graph Theory, 2013

Extremal results for odd cycles in sparse pseudorandom graphs.

Elad Aigner-Horev, Hiêp Hàn, Mathias Schacht

Electron. Notes Discret. Math., 2013

2012

Polychromatic 4-coloring of cubic bipartite plane graphs.

Elad Horev, Matthew J. Katz, Roi Krakovski, Atsuhiro Nakamoto

Discret. Math., 2012

2011

Extremal graphs without a semi-topological wheel.

Elad Horev

J. Graph Theory, 2011

Decomposing infinite matroids into their 3-connected minors.

Elad Aigner-Horev, Reinhard Diestel, Luke Postle

Electron. Notes Discret. Math., 2011

On colorability of graphs with forbidden minors along paths and circuits.

Elad Horev

Discret. Math., 2011

2010

Conflict-Free Coloring Made Stronger.

Elad Horev, Roi Krakovski, Shakhar Smorodinsky

Proceedings of the Algorithm Theory, 2010

2009

Polychromatic colorings of bounded degree plane graphs.

Elad Horev, Roi Krakovski

J. Graph Theory, 2009

Polychromatic 4-coloring of guillotine subdivisions.

Elad Horev, Matthew J. Katz, Roi Krakovski, Maarten Löffler

Inf. Process. Lett., 2009

Polychromatic colorings of rectangular partitions.

Darko Dimitrov, Elad Horev, Roi Krakovski

Discret. Math., 2009