35 citations · 69 across the 35 of their papers we have counts for
44 papers
Exact-palette rainbow embeddings in uniformly coloured pseudorandom graphs
Elad Aigner-Horev, Dan Hefetz, Yury Person +1
We study rainbow spanning configurations in bijumbled graphs whose edges are coloured independently and uniformly from a prescribed palette. For -vertex -bijumbled graphs…
Resilience of rainbow Hamilton cycles in pseudorandom graphs
Elad Aigner-Horev, Dan Hefetz, Yury Person
For every fixed , we prove that every spanning subgraph of an -vertex -bijumbled graph satisfying contains a rain…
Rainbow spanning configurations in uniformly coloured pseudorandom graphs
Elad Aigner-Horev, Dan Hefetz, Yury Person +1
We prove a quantitative palette-transference principle for rainbow spanning configurations in uniformly edge-coloured pseudorandom graphs. The input to our transference principle i…
On graphs whose cycle space is spanned by their Hamilton cycles
Dan Hefetz, Michael Krivelevich
The cycle space of a graph , denoted , is a vector space over , spanned by all incidence vectors of edge-sets of cycles of . If has ver…
The Hamilton cycle space of random regular graphs and randomly perturbed graphs
Dan Hefetz, Michael Krivelevich
The cycle space of a graph , denoted , is a vector space over , spanned by all incidence vectors of edge-sets of cycles of . If has vertices, the…
The Hamilton cycle space of random graphs
Dan Hefetz, Michael Krivelevich
The cycle space of a graph , denoted , is a vector space over , spanned by all incidence vectors of edge-sets of cycles of . If has vertices, the…