13 citations · 19 across the 14 of their papers we have counts for
4 papers · 1 filter
Tight Hamilton cycles with high discrepancy
Lior Gishboliner, Stefan Glock, Amedeo Sgueglia
In this paper, we study discrepancy questions for spanning subgraphs of -uniform hypergraphs. Our main result is that, for any integers and , any -colourin…
On a problem of Brown, Erdős and Sós
Shoham Letzter, Amedeo Sgueglia
Let be the maximum number of edges in an -vertex -uniform hypergraph not containing a subhypergraph with edges on at most vertices. Recently, Delcour…
Rainbow subgraphs of uniformly coloured randomly perturbed graphs
Kyriakos Katsamaktsis, Shoham Letzter, Amedeo Sgueglia
For a given , the randomly perturbed graph model is defined as the union of any -vertex graph with minimum degree and the binomial random graph $\mathbf{G…
Rainbow Hamiltonicity in uniformly coloured perturbed digraphs
Kyriakos Katsamaktsis, Shoham Letzter, Amedeo Sgueglia
We investigate the existence of a rainbow Hamilton cycle in a uniformly edge-coloured randomly perturbed digraph. We show that for every there exists su…