Cliques in graphs with bounded minimum degree

DOI10.1017/S0963548311000745zbMATH Open1242.05132OpenAlexW2129178250MaRDI QIDQ2888872FDOQ2888872

Allan Lo

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

zbMATH Keywords

\(r\)-cliques

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Flag algebras
• 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
• Lower bounds on the number of triangles in a graph
• On the Minimal Density of Triangles in Graphs
• On complete subgraphs of different orders
• Triangles in Regular Graphs with Density Below One Half

Cited In (9)

• Triangle-degrees in graphs and tetrahedron coverings in 3-graphs
• Cliques with maximum/minimum edge neighborhood and neighborhood density
• Edge-Disjoint Cliques in Graphs with High Minimum Degree
• Many cliques with few edges and bounded maximum degree
• Note on the structure of graphs with bounded clique number
• Minimum \((n,k,t)\) clique graphs
• Minimum Number ofk-Cliques in Graphs with Bounded Independence Number
• Cliques, minors and apex graphs
• Counting triangles in regular 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)