Triangles in regular graphs with density below one half

DOI10.1017/S0963548309009857MaRDI QIDQ3557499zbMATH OpenFDO

Authors Allan Lo

Publication date 23 April 2010

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

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

zbMATH Keywords

extremal graphsminimum number of trianglesregular graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Density (toughness, etc.) (05C42)

Recommendations

• Regular graphs with many triangles are structured
• On the Minimal Density of Triangles in Graphs
• Triangle-free regular graphs
• An extremal problem motivated by triangle-free strongly regular graphs
• The minimal density of triangles in tripartite graphs

Cites work

• An inequality for degree sequences
• An upper bound on the sum of squares of degrees in a graph
• Graphs with maximal number of adjacent pairs of edges
• Maximizing the sum of the squares of the degrees of a graph
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• The sum of the squares of degrees: sharp asymptotics

Cited in

(11)

• Regular graphs with many triangles are structured
• An extremal problem motivated by triangle-free strongly regular graphs
• Cliques in graphs with bounded minimum degree
• Cliques in graphs with bounded minimum degree
• On the Minimal Density of Triangles in Graphs
• Neighborhood champions in regular graphs
• On the density of triangles and squares in regular finite and unimodular random graphs
• Sparse halves in dense triangle-free graphs
• Minimal regular graphs with every edge in a triangle
• Counting triangles in regular graphs
• Measures of information spread, spanning trees, and walks in regular graphs

This page was built for publication: Triangles in regular graphs with density below one half

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