On the edge distribution of a graph

DOI10.1017/S0963548301004837MaRDI QIDQ2777899zbMATH OpenOpenAlexWikidataFDO

Authors 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

edge distributioneigenvaluelocal densitymaximal cut

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• MaxCut in ${\bm H)$-Free Graphs
• How to make a graph bipartite
• Bipartite subgraphs
• Edge Distribution of Graphs with Few Copies of a Given Graph
• Making a K₄-free graph bipartite

Cited in

(8)

• Graphs and Hermitian matrices: eigenvalue interlacing
• Maximum bisections of graphs without short even cycles
• Counting results for sparse pseudorandom hypergraphs. I.
• Counting results for sparse pseudorandom hypergraphs. II.
• Edge Distribution of Graphs with Few Copies of a Given Graph
• Nearly uniform distribution of edges amongk-subgraphs of a graph
• A completion of the proof of the Edge-statistics Conjecture
• Edge distribution and density in the characteristic sequence

This page was built for publication: On the edge distribution of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2777899)