A note on the maximum number of triangles in a C5‐free graph
From MaRDI portal
Publication:4629994
Recommendations
- A note on the maximum number of triangles in a C₅-free graph
- On the number of \(C_ 5's\) in a triangle-free graph
- On the maximum number of five-cycles in a triangle-free graph
- The maximum number of triangles in \(C_{2k+1}\)-free graphs
- A note on maximal triangle‐free graphs
- The maximum number of triangles in \(F_k\)-free graphs
- Triangles in C5‐free graphs and hypergraphs of girth six
- The number of the maximal triangle-free graphs
- On the minimum number of edges in triangle-free 5-critical graphs
- On the number of pentagons in triangle-free graphs
Cited in
(35)- On the number of \(C_ 5's\) in a triangle-free graph
- Pentagons in triangle-free graphs
- A note on the maximum number of triangles in a C₅-free graph
- On the number of pentagons in triangle-free graphs
- Maximizing five-cycles in \(K_r\)-free graphs
- Generalized Turán densities in the hypercube
- Some exact results for generalized Turán problems
- Multicolor Turán numbers
- On generalized Turán number of two disjoint cliques
- Some extremal results on hypergraph Turán problems
- Generalized Turán problems for even cycles
- Complete subgraphs in connected graphs and its application to spectral moment
- The maximum number of paths of length four in a planar graph
- Triangles in graphs without bipartite suspensions
- Some exact results of the generalized Turán numbers for paths
- Further notes on: Largest triangle-free subgraphs in powers of cycles
- scientific article; zbMATH DE number 5943492 (Why is no real title available?)
- Tree densities in sparse graph classes
- Extensions of the Erdős-Gallai theorem and Luo's theorem
- The regularity method for graphs with few 4‐cycles
- Subgraph densities in a surface
- Extremal problems of double stars
- Triangles in C5‐free graphs and hypergraphs of girth six
- The maximum number of paths of length three in a planar graph
- Stability version of Dirac's theorem and its applications for generalized Turán problems
- Maximum cliques in a graph without disjoint given subgraph
- Exact generalized Turán number for K₃ versus suspension of P₄
- Regular decomposition of the edge set of a graph with applications
- Many triangles in \(C_5\)-free graphs
- The maximum number of short paths in a Halin graph
- Extremal problems for a matching and any other graph
- Exact results for generalized extremal problems forbidding an even cycle
- The number of cliques in hypergraphs with forbidden subgraphs
- On the maximum number of five-cycles in a triangle-free graph
- Pentagons vs. triangles
This page was built for publication: A note on the maximum number of triangles in a C5‐free graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4629994)
