3 citations · 8 across the 3 of their papers we have counts for
4 papers
Robust hamiltonicity of random directed graphs
Asaf Ferber, Rajko Nenadov, Andreas Noever +2
In his seminal paper from 1952 Dirac showed that the complete graph on vertices remains Hamiltonian even if we allow an adversary to remove edges tou…
Universality of random graphs and rainbow embedding
Asaf Ferber, Rajko Nenadov, Ueli Peter
In this paper we show how to use simple partitioning lemmas in order to embed spanning graphs in a typical member of . Let the \emph{maximum density} of a graph be the…
Random Hyperbolic Graphs: Degree Sequence and Clustering
Luca Gugelmann, Konstantinos Panagiotou, Ueli Peter
In the last decades, the study of models for large real-world networks has been a very popular and active area of research. A reasonable model should not only replicate all the str…
On globally sparse Ramsey graphs
Torsten Mütze, Ueli Peter
We say that a graph has the Ramsey property w.r.t.\ some graph and some integer , or is -Ramsey for short, if any -coloring of the edges of conta…