Cliques in dense inhomogeneous random graphs

DOI10.1002/rsa.20715zbMath1370.05188arXiv1510.02335OpenAlexW3103904697MaRDI QIDQ5357981

András Máthé, Martin Doležal, Jan Hladký

Publication date: 18 September 2017

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.02335

zbMATH Keywords

random graphsclique numbergraph limits

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Density (toughness, etc.) (05C42)

Related Items

Independent sets, cliques, and colorings in graphons ⋮ A limit theorem for small cliques in inhomogeneous random graphs ⋮ On the chromatic number in the stochastic block model ⋮ Locally uniform random permutations with large increasing subsequences ⋮ Matching polytons ⋮ Cliques in rank-1 random graphs: the role of inhomogeneity ⋮ Superlogarithmic Cliques in Dense Inhomogeneous Random Graphs