52 citations · 224 across the 34 of their papers we have counts for
3 papers · 2 filters
Going after the k-SAT Threshold
Amin Coja-Oghlan, Konstantinos Panagiotou
Random -SAT is the single most intensely studied example of a random constraint satisfaction problem. But despite substantial progress over the past decade, the threshold for th…
Coloring d-Embeddable k-Uniform Hypergraphs
Carl Georg Heise, Konstantinos Panagiotou, Oleg Pikhurko +1
This paper extends the scenario of the Four Color Theorem in the following way. Let H(d,k) be the set of all k-uniform hypergraphs that can be (linearly) embedded into R^d. We inve…
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…