Superlogarithmic Cliques in Dense Inhomogeneous Random Graphs

DOI10.1137/19M1249540zbMath1420.05162arXiv1903.01495MaRDI QIDQ5234663

Gweneth McKinley

Publication date: 30 September 2019

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

combinatoricsprobabilityrandom graphsclique numbergraph limitsgraphons

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 (3)

Power-law bounds for increasing subsequences in Brownian separable permutons and homogeneous sets in Brownian cographons ⋮ Locally uniform random permutations with large increasing subsequences ⋮ Cliques in rank-1 random graphs: the role of inhomogeneity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coloring random graphs
• High-dimensional random geometric graphs and their clique number
• Cliques in hyperbolic random graphs
• Limits of dense graph sequences
• Finding hidden cliques of size \(\sqrt{N/e}\) in nearly linear time
• Independent sets, cliques, and colorings in graphons
• Cliques in rank-1 random graphs: the role of inhomogeneity
• Random Graphs and Complex Networks
• Large Cliques in a Power-Law Random Graph
• The threshold for random k-SAT is 2 ^k (ln 2 - O(k))
• On colouring random graphs
• Parameterized Clique on Scale-Free Networks
• The phase transition in inhomogeneous random graphs
• Cliques in dense inhomogeneous random graphs
• Random Graphs

This page was built for publication: Superlogarithmic Cliques in Dense Inhomogeneous Random Graphs