10 citations · 10 across the 1 of their papers we have counts for
3 papers · 1 filter
Cliques in dense inhomogeneous random graphs
Martin Doležal, Jan Hladký, András Máthé
The theory of dense graph limits comes with a natural sampling process which yields an inhomogeneous variant G(n,W) of the Erdos-Renyi random graph. Here we study the clique number…
Poset limits can be totally ordered
Jan Hladky, Andras Mathe, Viresh Patel +1
S.Janson [Poset limits and exchangeable random posets, Combinatorica 31 (2011), 529--563] defined limits of finite posets in parallel to the emerging theory of limits of dense grap…
Hamilton cycles in dense vertex-transitive graphs
Demetres Christofides, Jan Hladký, András Máthé
A famous conjecture of Lovász states that every connected vertex-transitive graph contains a Hamilton path. In this article we confirm the conjecture in the case that the graph is…