Cliques in Graphs With Bounded Minimum Degree
From MaRDI portal
Publication:2888872
DOI10.1017/S0963548311000745zbMath1242.05132OpenAlexW2129178250MaRDI QIDQ2888872
Publication date: 4 June 2012
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548311000745
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (1)
Cites Work
- On the connection between chromatic number, maximal clique and minimal degree of a graph
- The number of cliques in graphs of given order and size
- 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
- Flag algebras
This page was built for publication: Cliques in Graphs With Bounded Minimum Degree