Amedeo Sgueglia

According to our database, Amedeo Sgueglia authored at least 9 papers between 2021 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Dirac's Theorem for Graphs of Bounded Bandwidth.

Alberto Espuny Díaz, Pranshu Gupta, Domenico Mergoni Cecchelli, Olaf Parczyk, Amedeo Sgueglia

Electron. J. Comb., 2026

2025

Spanning Spheres in Dirac Hypergraphs.

Freddie Illingworth, Richard Lang, Alp Müyesser, Olaf Parczyk, Amedeo Sgueglia

Comb., August, 2025

Rainbow subgraphs of uniformly coloured randomly perturbed graphs.

Kyriakos Katsamaktsis, Shoham Letzter, Amedeo Sgueglia

Innov. Graph Theory, 2025

Tight Hamilton cycles with high discrepancy.

Lior Gishboliner, Stefan Glock, Amedeo Sgueglia

Comb. Probab. Comput., 2025

2024

The square of a Hamilton cycle in randomly perturbed graphs.

Julia Böttcher, Olaf Parczyk, Amedeo Sgueglia, Jozef Skokan

Random Struct. Algorithms, 2024

Rainbow Hamiltonicity in uniformly coloured perturbed digraphs.

Kyriakos Katsamaktsis, Shoham Letzter, Amedeo Sgueglia

Comb. Probab. Comput., 2024

2023

Multistage positional games.

Juri Barkey, Dennis Clemens, Fabian Hamann, Mirjana Mikalacki, Amedeo Sgueglia

Discret. Math., September, 2023

Triangles in randomly perturbed graphs.

Julia Böttcher, Olaf Parczyk, Amedeo Sgueglia, Jozef Skokan

Comb. Probab. Comput., January, 2023

2021

Cycle factors in randomly perturbed graphs.

Julia Böttcher, Olaf Parczyk, Amedeo Sgueglia, Jozef Skokan

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021