Pages that link to "Item:Q713972"

The following pages link to On the maximum number of five-cycles in a triangle-free graph (Q713972):

Displaying 20 items.

• The Inducibility of Graphs on Four Vertices (Q5417819) (← links)
• Counting flags in triangle-free digraphs (Q5891231) (← links)
• On the inducibility of cycles (Q5916268) (← links)
• Many \(T\) copies in \(H\)-free graphs (Q5965526) (← links)
• On supersaturation and stability for generalized Turán problems (Q6055938) (← links)
• Generalized Turán results for intersecting cliques (Q6056423) (← links)
• The maximum number of triangles in \(F_k\)-free graphs (Q6056558) (← links)
• On the maximum number of odd cycles in graphs without smaller odd cycles (Q6056808) (← links)
• The maximum number of paths of length three in a planar graph (Q6057639) (← links)
• The maximum number of complete multipartite subgraphs in graphs with given circumference or matching number (Q6080217) (← links)
• The cycle of length four is strictly \(F\)-Turán-good (Q6090832) (← links)
• Stability version of Dirac's theorem and its applications for generalized Turán problems (Q6096834) (← links)
• Lower Bounds for Maximum Weighted Cut (Q6100613) (← links)
• Maximum cliques in a graph without disjoint given subgraph (Q6117354) (← links)
• Exact results on generalized Erdős-Gallai problems (Q6568830) (← links)
• On the generalized Turán problem for odd cycles (Q6606915) (← links)
• Generalized Turán problems for even cycles (Q6621207) (← links)
• On the maximum number of odd cycles in graphs without smaller odd cycles (Q6621212) (← links)
• Multicolor Turán numbers. II: A generalization of the Ruzsa-Szemerédi theorem and new results on cliques and odd cycles (Q6642510) (← links)
• The maximum number of pentagons in a planar graph (Q6657591) (← links)