Elad Aigner‐Horev

1. Cycle lengths in randomly perturbed graphs
   2022/06/24 by Elad Aigner‐Horev, Aigner-Horev, Elad, Dan Hefetz +3 · 4 citations
   Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory #Markov Chains and Monte Carlo Methods #Stochastic processes and statistical mechanics
2. The structure of 2-separations of infinite matroids
   2012/01/05 by Elad Aigner-Horev, Elad Aigner‐Horev, Aigner-Horev, Elad +4 · 1 citation
   Computer Science · Mathematics · #05 #Advanced Algebra and Logic #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #FOS: Mathematics #math.CO #msc:05
3. Large rainbow cliques in randomly perturbed dense graphs
   2019/12/31 by Elad Aigner‐Horev, Aigner-Horev, Elad, Oran Danon +5 · 1 citation
   Computer Science · Mathematics · #Advanced Topology and Set Theory #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #FOS: Mathematics #Limits and Structures in Graph Theory