On the maximal number of independent triangles in graphs

DOI10.1007/BF02992869zbMath0111.35901MaRDI QIDQ1131113

G. A. Dirac

Publication date: 1963

Published in: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (Search for Journal in Brave)

zbMATH Keywords

topology

Related Items (10)

Triangles in randomly perturbed graphs ⋮ The confirmation of a conjecture on disjoint cycles in a graph ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Independent triangles covering given vertices of a graph ⋮ Graph partition into \(K_{3}\)s and \(K_{4}\)s ⋮ On the number of independent chorded cycles in a graph ⋮ Graph partition into small cliques ⋮ Vertex-disjoint 4-cycles containing specified edges in a bipartite graph ⋮ Anti-Ramsey numbers for vertex-disjoint triangles ⋮ Note on rainbow triangles in edge-colored graphs

Cites Work

• On Complete Graphs and Complete Stars Contained as Subgraphs in Graphs.

This page was built for publication: On the maximal number of independent triangles in graphs