Elad Aigner-Horev

Orcid: 0000-0002-9207-0596

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Resilience of the quadratic Littlewood-Offord problem.
CoRR, 2024

Ramsey Properties of Randomly Perturbed Hypergraphs.
Proceedings of the Approximation, 2024

2023
Cycle lengths in randomly perturbed graphs.
Random Struct. Algorithms, December, 2023

Rainbow trees in uniformly edge-colored graphs.
Random Struct. Algorithms, March, 2023

An asymmetric random Rado theorem: 1-statement.
J. Comb. Theory A, 2023

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

2022
Large Rainbow Cliques in Randomly Perturbed Dense Graphs.
SIAM J. Discret. Math., December, 2022

Envy-free matchings in bipartite graphs and their applications to fair division.
Inf. Sci., 2022

Small rainbow cliques in randomly perturbed dense graphs.
Eur. J. Comb., 2022

On sparse random combinatorial matrices.
Discret. Math., 2022

2021
Rainbow Hamilton Cycles in Randomly Colored Randomly Perturbed Dense Graphs.
SIAM J. Discret. Math., 2021

Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs.
Comb. Probab. Comput., 2021

2019
Monochromatic Schur Triples in Randomly Perturbed Dense Sets of Integers.
SIAM J. Discret. Math., 2019

2018
On the intersection of infinite matroids.
Discret. Math., 2018

2017
Linear quasi-randomness of subsets of abelian groups and hypergraphs.
Electron. Notes Discret. Math., 2017

Quasirandomness in hypergraphs.
Electron. Notes Discret. Math., 2017

2016
The structure of 2-separations of infinite matroids.
J. Comb. Theory B, 2016

2015
Arithmetic progressions with a pseudorandom step.
Electron. Notes Discret. Math., 2015

2013
On <i>r</i>-Connected Graphs with No Semi-topological <i>r</i>-Wheel.
J. Graph Theory, 2013

Extremal results for odd cycles in sparse pseudorandom graphs.
Electron. Notes Discret. Math., 2013

2012
Polychromatic 4-coloring of cubic bipartite plane graphs.
Discret. Math., 2012

2011
Extremal graphs without a semi-topological wheel.
J. Graph Theory, 2011

Decomposing infinite matroids into their 3-connected minors.
Electron. Notes Discret. Math., 2011

On colorability of graphs with forbidden minors along paths and circuits.
Discret. Math., 2011

2010
Conflict-Free Coloring Made Stronger.
Proceedings of the Algorithm Theory, 2010

2009
Polychromatic colorings of bounded degree plane graphs.
J. Graph Theory, 2009

Polychromatic 4-coloring of guillotine subdivisions.
Inf. Process. Lett., 2009

Polychromatic colorings of rectangular partitions.
Discret. Math., 2009


  Loading...