Pages that link to "Item:Q1689946"
From MaRDI portal
The following pages link to A note on the maximum number of triangles in a \(C_5\)-free graph (Q1689946):
Displaying 8 items.
- On the maximum number of five-cycles in a triangle-free graph (Q713972) (← links)
- On the number of \(C_ 5's\) in a triangle-free graph (Q1124605) (← links)
- Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs (Q1713504) (← links)
- Maximizing five-cycles in \(K_r\)-free graphs (Q2048348) (← links)
- Counting copies of a fixed subgraph in \(F\)-free graphs (Q2323254) (← links)
- (Q3090025) (← links)
- A note on the maximum number of triangles in a <i>C</i><sub>5</sub>‐free graph (Q4629994) (← links)
- Many H-Copies in Graphs with a Forbidden Tree (Q5204067) (← links)