Elad Aigner-Horev

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 19

Top Topics

Bipartite Graph

Higher Order Relations

Top Venues

SIAM J. Discret. Math.

Electron. Notes Discret. Math.

Random Struct. Algorithms

Publications

Elad Aigner-Horev, Daniel Rozenberg, Roi Weiss
Resilience of the quadratic Littlewood-Offord problem. CoRR (2024)
Elad Aigner-Horev, Yury Person
An asymmetric random Rado theorem: 1-statement. J. Comb. Theory, Ser. A 193 (2023)
Elad Aigner-Horev, Dan Hefetz, Michael Krivelevich
Cycle lengths in randomly perturbed graphs. Random Struct. Algorithms 63 (4) (2023)
Elad Aigner-Horev, Dan Hefetz, Abhiruk Lahiri
Rainbow trees in uniformly edge-colored graphs. Random Struct. Algorithms 62 (2) (2023)
Elad Aigner-Horev, Dan Hefetz, Michael Trushkin
Smoothed Analysis of the Komlós Conjecture: Rademacher Noise. CoRR (2023)
Elad Aigner-Horev, Oran Danon, Dan Hefetz, Shoham Letzter
Small rainbow cliques in randomly perturbed dense graphs. Eur. J. Comb. 101 (2022)
Elad Aigner-Horev, Yury Person
On sparse random combinatorial matrices. Discret. Math. 345 (11) (2022)
Elad Aigner-Horev, Oran Danon, Dan Hefetz, Shoham Letzter
Large Rainbow Cliques in Randomly Perturbed Dense Graphs. SIAM J. Discret. Math. 36 (4) (2022)
Elad Aigner-Horev, Erel Segal-Halevi
Envy-free matchings in bipartite graphs and their applications to fair division. Inf. Sci. 587 (2022)
Elad Aigner-Horev, Gil Levy
Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs. Comb. Probab. Comput. 30 (3) (2021)
Elad Aigner-Horev, Dan Hefetz
Rainbow Hamilton Cycles in Randomly Colored Randomly Perturbed Dense Graphs. SIAM J. Discret. Math. 35 (3) (2021)
Elad Aigner-Horev, Hiêp Hàn
Linear quasi-randomness of subsets of abelian groups and hypergraphs. Eur. J. Comb. 88 (2020)
Elad Aigner-Horev, Yury Person
Monochromatic Schur Triples in Randomly Perturbed Dense Sets of Integers. SIAM J. Discret. Math. 33 (4) (2019)
Elad Aigner-Horev, Johannes Carmesin, Jan-Oliver Fröhlich
On the intersection of infinite matroids. Discret. Math. 341 (6) (2018)
Elad Aigner-Horev, David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht
Quasirandomness in Hypergraphs. Electron. J. Comb. 25 (3) (2018)
Elad Aigner-Horev, David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht
Quasirandomness in hypergraphs. Electron. Notes Discret. Math. 61 (2017)
Elad Aigner-Horev, Hiêp Hàn
Linear quasi-randomness of subsets of abelian groups and hypergraphs. Electron. Notes Discret. Math. 61 (2017)
Elad Aigner-Horev, Reinhard Diestel, Luke Postle
The structure of 2-separations of infinite matroids. J. Comb. Theory, Ser. B 116 (2016)
Elad Aigner-Horev, Hiêp Hàn
Arithmetic progressions with a pseudorandom step. Electron. Notes Discret. Math. 49 (2015)
Elad Aigner-Horev, Hiêp Hàn, Mathias Schacht
Extremal results for odd cycles in sparse pseudorandom graphs. Comb. 34 (4) (2014)
Elad Aigner-Horev, Hiêp Hàn, Mathias Schacht
Extremal results for odd cycles in sparse pseudorandom graphs. Electron. Notes Discret. Math. 44 (2013)
Elad Aigner-Horev, Reinhard Diestel, Luke Postle
Decomposing infinite matroids into their 3-connected minors. Electron. Notes Discret. Math. 38 (2011)