Cliques in graphs with bounded minimum degree
type: Item
instance of: scholarly article
zbMATH Open document ID: 1242.05132
DOI: 10.1017/S0963548311000745
author: Allan Lo
published in: Combinatorics, Probability and Computing
publication date: 2012-06-04T00:00:00Z
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 6042690
zbMATH Keywords: \(r\)-cliques
MaRDI profile type: Publication
cites work: Flag algebras
cites work: The number of cliques in graphs of given order and size
cites work: Triangles in Regular Graphs with Density Below One Half
cites work: On the Minimal Density of Triangles in Graphs
cites work: On complete subgraphs of different orders
cites work: On the connection between chromatic number, maximal clique and minimal degree of a graph
cites work: Lower bounds on the number of triangles in a graph
full work available at URL: s0963548311000745
OpenAlex ID: W2129178250
title: Cliques in graphs with bounded minimum degree
description: scientific article; zbMATH DE number 6042690