A Remark on the Number of Complete and Empty Subgraphs

DOI10.1017/S0963548397003234zbMath0908.05051OpenAlexW2166410769MaRDI QIDQ4212882

Richard H. Schelp, Andrew G. Thomason

Publication date: 24 November 1998

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548397003234

zbMATH Keywords

number of complete subgraphs

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Related Items (5)

Unnamed Item ⋮ The clique density theorem ⋮ On quadrilaterals in layers of the cube and extremal problems for directed and oriented graphs ⋮ Stability from graph symmetrisation arguments with applications to inducibility ⋮ The feasible region of induced graphs

This page was built for publication: A Remark on the Number of Complete and Empty Subgraphs