On the generalized Turán problem for odd cycles
From MaRDI portal
(Redirected from Publication:6606915)
Recommendations
Cites work
- A generalized Turán problem and its applications
- Generalized Turán problems for even cycles
- Graph removal lemmas
- scientific article; zbMATH DE number 3869331 (Why is no real title available?)
- scientific article; zbMATH DE number 3188526 (Why is no real title available?)
- scientific article; zbMATH DE number 3050594 (Why is no real title available?)
- Many \(T\) copies in \(H\)-free graphs
- On 3-uniform hypergraphs without a cycle of a given length
- On maximal paths and circuits of graphs
- On the maximum number of five-cycles in a triangle-free graph
- On the maximum number of odd cycles in graphs without smaller odd cycles
- On the number of \(C_ 5's\) in a triangle-free graph
- On the number of pentagons in triangle-free graphs
- Pentagons in triangle-free graphs
- Pentagons vs. triangles
- The maximum number of q-cliques in a graph with no p-clique
- The maximum number of triangles in \(C_{2k+1}\)-free graphs
Cited in
(4)- On the maximum number of odd cycles in graphs without smaller odd cycles
- Counting cliques without generalized theta graphs
- Generalized Ramsey-Turán density for cliques
- Maximum number of cliques in \(\{C_{k_1}, C_{k_2}, C_{k_3}, \cdots \}\)-free graphs with \(6 = k_1 < k_2 < \cdots\) and \(k_{i+1} - k_i \leq 5\)
This page was built for publication: On the generalized Turán problem for odd cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606915)
