Paperlane

no. 3 · Tuesday 27 October 2026

A sharp bound on the binding number of $K_k$-free graphs and the Brandt conjecture

Jifu Lin and Heng Yang

math.CO · v2 · 12 pp

Abstract

The binding number of a graph is the smallest ratio $|N(S)|/|S|$ among all nonempty vertex sets $S$ whose neighborhood $N(S)$ is not the whole vertex set. We prove that every finite nonempty $K_k$-free graph has binding number at most $k-2$ for every $k\ge6$, confirming Brandt's conjecture; the bound is sharp for complete $(k-1)$-partite graphs with equal nonempty parts. We first prove the case $k=6$ and then extend it to all $k\ge6$ by induction.

comments
12 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.28536 ↗