The local density of triangle-free graphs

DOI10.1016/S0012-365X(97)00074-5zbMath0895.05042MaRDI QIDQ1382812

Stephan Brandt

Publication date: 14 September 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

eigenvaluesdensityadjacency matrixtriangle-free graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (4)

The clique number and the smallest \(Q\)-eigenvalue of graphs ⋮ Note on the sum of the smallest and largest eigenvalues of a triangle-free graph ⋮ Maximum spread of graphs and bipartite graphs ⋮ The Spectrum of Triangle-Free Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to make a graph bipartite
• A local density condition for triangles
• The generation of maximal triangle-free graphs
• On the edge distribution in triangle-free graphs
• A simple group of order 44,352,000

This page was built for publication: The local density of triangle-free graphs