On the Edge Distribution of a Graph

DOI10.1017/S0963548301004837zbMath0996.05077OpenAlexW1996094909WikidataQ105583877 ScholiaQ105583877MaRDI QIDQ2777899

Vladimir Nikiforov

Publication date: 25 April 2002

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

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

zbMATH Keywords

eigenvaluelocal densityedge distributionmaximal cut

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (4)

Counting results for sparse pseudorandom hypergraphs. I. ⋮ Counting results for sparse pseudorandom hypergraphs. II. ⋮ Maximum bisections of graphs without short even cycles ⋮ Graphs and Hermitian matrices: eigenvalue interlacing

This page was built for publication: On the Edge Distribution of a Graph