Cliques in graphs with bounded minimum degree
From MaRDI portal
Publication:2888872
Recommendations
Cites work
- Flag algebras
- Lower bounds on the number of triangles in a graph
- On complete subgraphs of different orders
- On the Minimal Density of Triangles in Graphs
- 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
- Triangles in regular graphs with density below one half
Cited in
(11)- Cliques in graphs with bounded minimum degree
- Note on the structure of graphs with bounded clique number
- Edge-Disjoint Cliques in Graphs with High Minimum Degree
- Cliques, minors and apex graphs
- Counting triangles in regular graphs
- Many cliques with few edges and bounded maximum degree
- Minimum \((n,k,t)\) clique graphs
- Minimum Number ofk-Cliques in Graphs with Bounded Independence Number
- Cliques with maximum/minimum edge neighborhood and neighborhood density
- The number of cliques in graphs of given order and size
- Triangle-degrees in graphs and tetrahedron coverings in 3-graphs
This page was built for publication: Cliques in graphs with bounded minimum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2888872)