The typical structure of graphs with no large cliques

DOI10.1007/s00493-015-3290-9zbMath1399.05119arXiv1406.6961MaRDI QIDQ681594

József Balogh, Hong Liu, Robert Morris, Maryam Sharifzadeh, Neal Bushaw, Maurício Collares

Publication date: 12 February 2018

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

cliques; triangle-free graphs; stability theorem

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C30: Enumeration in graph theory

05C75: Structural characterization of families of graphs

05D40: Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.)