Triangles in Regular Graphs with Density Below One Half
From MaRDI portal
Publication:3557499
DOI10.1017/S0963548309009857zbMath1198.05104MaRDI QIDQ3557499
Publication date: 23 April 2010
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Related Items
Cites Work
- An inequality for degree sequences
- An upper bound on the sum of squares of degrees in a graph
- On the connection between chromatic number, maximal clique and minimal degree of a graph
- Maximizing the sum of the squares of the degrees of a graph
- The sum of the squares of degrees: sharp asymptotics
- Graphs with maximal number of adjacent pairs of edges