The maximum number of triangles in a K₄-free graph
From MaRDI portal
Publication:1297475
Recommendations
Cites work
- scientific article; zbMATH DE number 3752881 (Why is no real title available?)
- scientific article; zbMATH DE number 3529891 (Why is no real title available?)
- scientific article; zbMATH DE number 3188526 (Why is no real title available?)
- Dependence polynomials
- Lower bounds on the number of triangles in a graph
- On a theorem of Rademacher-Turán
- On the Number of Triangles Contained in Certain Graphs
- On the connection between chromatic number, maximal clique and minimal degree of a graph
- Shadows of colored complexes.
- Sur les relations symétriques dans l'ensemble fini
- The number of triangles in a \(K_ 4\)-free graph
Cited in
(16)- A new Turán-type theorem for cliques in graphs
- The maximum number of triangles in \(F_k\)-free graphs
- On the maximum number of cliques in a graph embedded in a surface
- On clique values identities and Mantel-type theorems
- Face vectors of flag complexes
- Many triangles with few edges
- Tree densities in sparse graph classes
- A Kruskal-Katona type theorem for graphs
- The number of 4-cycles in triangle-free oriented graphs
- On the maximum number of cliques in a graph
- Cliques in graphs excluding a complete graph minor
- The determination of the total chromatic number of series-parallel graphs with \((G) \geq 4\)
- scientific article; zbMATH DE number 1047729 (Why is no real title available?)
- Maximum cardinality neighbourly sets in quadrilateral free graphs
- Maximal induced matchings in \(K_4\)-free and \(K_5\)-free graphs
- A Note on the Number of Triangles in Graphs Without the Suspension of a Path on Four Vertices
This page was built for publication: The maximum number of triangles in a \(K_4\)-free graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1297475)
