Alberto Espuny Díaz

Orcid: 0000-0001-5066-3820

According to our database1, Alberto Espuny Díaz authored at least 16 papers between 2018 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Dirac's Theorem for Graphs of Bounded Bandwidth.
Electron. J. Comb., 2026

2025
Seymour's second neighbourhood conjecture: random graphs and reductions.
Random Struct. Algorithms, January, 2025

How Many Random Edges Make an Almost-Dirac Graph Hamiltonian?
Electron. J. Comb., 2025

Exponential Odd-Distance Sets under the Manhattan Metric.
Electron. J. Comb., 2025

2024
Long running times for hypergraph bootstrap percolation.
Eur. J. Comb., January, 2024

Sharp threshold for embedding balanced spanning trees in random geometric graphs.
J. Graph Theory, 2024

Powers of Hamilton cycles in dense graphs perturbed by a random geometric graph.
Eur. J. Comb., 2024

2023
Spanning -cycles in random graphs.
Comb. Probab. Comput., September, 2023

Hamiltonicity of graphs perturbed by a random regular graph.
Random Struct. Algorithms, July, 2023

Hamiltonicity of graphs perturbed by a random geometric graph.
J. Graph Theory, May, 2023

2022
Speeding up random walk mixing by starting from a uniform vertex.
CoRR, 2022

2021
Dirac's theorem for random regular graphs.
Comb. Probab. Comput., 2021

Hamiltonicity of random subgraphs of the hypercube.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2019
Edge Correlations in Random Regular Hypergraphs and Applications to Subgraph Testing.
SIAM J. Discret. Math., 2019

Resilient Degree Sequences with respect to Hamilton Cycles and Matchings in Random Graphs.
Electron. J. Comb., 2019

2018
Entropy versions of additive inequalities.
Electron. Notes Discret. Math., 2018


  Loading...