Cliques in graphs with bounded minimum degree

DOI10.1016/J.ENDM.2009.07.027zbMath1273.05165arXiv1009.5296OpenAlexW2219244321MaRDI QIDQ2851457

Allan Lo

Publication date: 10 October 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

minimum degreenumber of cliques

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• On the connection between chromatic number, maximal clique and minimal degree of a graph
• The sum of the squares of degrees: sharp asymptotics
• On the Minimal Density of Triangles in Graphs
• Triangles in Regular Graphs with Density Below One Half
• Lower bounds on the number of triangles in a graph
• On complete subgraphs of different orders
• On the number of complete subgraphs and circuits contained in graphs

This page was built for publication: Cliques in graphs with bounded minimum degree