Cliques in graphs with bounded minimum degree
From MaRDI portal
Publication:2851457
DOI10.1016/j.endm.2009.07.027zbMath1273.05165arXiv1009.5296MaRDI QIDQ2851457
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
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
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