default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElad Aigner-Horev
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j27]Elad Aigner-Horev
, Yury Person:
An asymmetric random Rado theorem: 1-statement. J. Comb. Theory A 193: 105687 (2023)- [j26]Elad Aigner-Horev, Dan Hefetz, Abhiruk Lahiri:
Rainbow trees in uniformly edge-colored graphs. Random Struct. Algorithms 62(2): 287-303 (2023) - [j25]Elad Aigner-Horev, Dan Hefetz, Michael Krivelevich:
Cycle lengths in randomly perturbed graphs. Random Struct. Algorithms 63(4): 867-884 (2023) - 2022
- [j24]Elad Aigner-Horev, Yury Person:
On sparse random combinatorial matrices. Discret. Math. 345(11): 113017 (2022) - [j23]Elad Aigner-Horev, Oran Danon, Dan Hefetz, Shoham Letzter:
Small rainbow cliques in randomly perturbed dense graphs. Eur. J. Comb. 101: 103452 (2022) - [j22]Elad Aigner-Horev, Erel Segal-Halevi:
Envy-free matchings in bipartite graphs and their applications to fair division. Inf. Sci. 587: 164-187 (2022) - [j21]Elad Aigner-Horev, Oran Danon, Dan Hefetz, Shoham Letzter:
Large Rainbow Cliques in Randomly Perturbed Dense Graphs. SIAM J. Discret. Math. 36(4): 2975-2994 (2022) - 2021
- [j20]Elad Aigner-Horev, Gil Levy:
Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs. Comb. Probab. Comput. 30(3): 412-443 (2021) - [j19]Elad Aigner-Horev, Dan Hefetz:
Rainbow Hamilton Cycles in Randomly Colored Randomly Perturbed Dense Graphs. SIAM J. Discret. Math. 35(3): 1569-1577 (2021) - 2020
- [j18]Elad Aigner-Horev, Hiêp Hàn:
Linear quasi-randomness of subsets of abelian groups and hypergraphs. Eur. J. Comb. 88: 103116 (2020) - 2019
- [j17]Elad Aigner-Horev, Yury Person:
Monochromatic Schur Triples in Randomly Perturbed Dense Sets of Integers. SIAM J. Discret. Math. 33(4): 2175-2180 (2019) - 2018
- [j16]Elad Aigner-Horev, David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht:
Quasirandomness in Hypergraphs. Electron. J. Comb. 25(3): 3 (2018) - [j15]Elad Aigner-Horev, Johannes Carmesin, Jan-Oliver Fröhlich:
On the intersection of infinite matroids. Discret. Math. 341(6): 1582-1596 (2018) - 2017
- [j14]Elad Aigner-Horev, David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht:
Quasirandomness in hypergraphs. Electron. Notes Discret. Math. 61: 13-19 (2017) - [j13]Elad Aigner-Horev, Hiêp Hàn:
Linear quasi-randomness of subsets of abelian groups and hypergraphs. Electron. Notes Discret. Math. 61: 21-27 (2017) - 2016
- [j12]Elad Aigner-Horev, Reinhard Diestel, Luke Postle:
The structure of 2-separations of infinite matroids. J. Comb. Theory B 116: 25-56 (2016) - 2015
- [j11]Elad Aigner-Horev, Hiêp Hàn:
Arithmetic progressions with a pseudorandom step. Electron. Notes Discret. Math. 49: 447-455 (2015) - 2014
- [j10]Elad Aigner-Horev, Hiêp Hàn, Mathias Schacht:
Extremal results for odd cycles in sparse pseudorandom graphs. Comb. 34(4): 379-406 (2014) - 2013
- [j9]Elad Aigner-Horev, Hiêp Hàn, Mathias Schacht:
Extremal results for odd cycles in sparse pseudorandom graphs. Electron. Notes Discret. Math. 44: 385-391 (2013) - [j8]Elad Horev, Michael Lomonosov:
On r-Connected Graphs with No Semi-topological r-Wheel. J. Graph Theory 72(3): 267-290 (2013) - 2012
- [j7]Elad Horev, Matthew J. Katz, Roi Krakovski, Atsuhiro Nakamoto:
Polychromatic 4-coloring of cubic bipartite plane graphs. Discret. Math. 312(4): 715-719 (2012) - 2011
- [j6]Elad Horev:
On colorability of graphs with forbidden minors along paths and circuits. Discret. Math. 311(8-9): 699-704 (2011) - [j5]Elad Aigner-Horev, Reinhard Diestel, Luke Postle:
Decomposing infinite matroids into their 3-connected minors. Electron. Notes Discret. Math. 38: 11-16 (2011) - [j4]Elad Horev:
Extremal graphs without a semi-topological wheel. J. Graph Theory 68(4): 326-339 (2011) - 2009
- [j3]Darko Dimitrov, Elad Horev, Roi Krakovski:
Polychromatic colorings of rectangular partitions. Discret. Math. 309(9): 2957-2960 (2009) - [j2]Elad Horev, Matthew J. Katz, Roi Krakovski, Maarten Löffler:
Polychromatic 4-coloring of guillotine subdivisions. Inf. Process. Lett. 109(13): 690-694 (2009) - [j1]Elad Horev, Roi Krakovski:
Polychromatic colorings of bounded degree plane graphs. J. Graph Theory 60(4): 269-283 (2009)
Conference and Workshop Papers
- 2024
- [c2]Elad Aigner-Horev, Dan Hefetz, Mathias Schacht:
Ramsey Properties of Randomly Perturbed Hypergraphs. APPROX/RANDOM 2024: 59:1-59:18 - 2010
- [c1]Elad Horev, Roi Krakovski, Shakhar Smorodinsky:
Conflict-Free Coloring Made Stronger. SWAT 2010: 105-117
Informal and Other Publications
- 2024
- [i3]Elad Aigner-Horev, Daniel Rozenberg, Roi Weiss:
Resilience of the quadratic Littlewood-Offord problem. CoRR abs/2402.10504 (2024) - 2023
- [i2]Elad Aigner-Horev, Dan Hefetz, Michael Trushkin:
Smoothed Analysis of the Komlós Conjecture: Rademacher Noise. CoRR abs/2307.06285 (2023) - 2010
- [i1]Elad Horev, Roi Krakovski, Shakhar Smorodinsky:
Conflict-Free Coloring Made Stronger. CoRR abs/1006.2926 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
