turan_number Module Reference

Compute the number of edges in a Turan graph. More...

Functions
template<Integer T>
constexpr T	ntlib::turan_number (T n, T k) noexcept
	Computes the number of edges in the Turan graph \(T(n,k)\).

Detailed Description

Compute the number of edges in a Turan graph.

The Turan graph \(T(n,k)\) is a complete \(k\)-partite graph on \(n\) vertices with almost equal parts. By Turan's theorem, the Turan graph \(T(n,k)\) is the unique graph with the maximum number of edges not containing \(K_{k+1}\) as a subgraph.

Files
file	modules/combinatorics/turan_number.cpp
	Primary module interface unit for module turan_number.

---

Generated by  1.16.1