Pages that link to "Item:Q898130"

The following pages link to Triangle-free graphs with the maximum number of cycles (Q898130):

Displaying 5 items.

• Proof of Komlós's conjecture on Hamiltonian subsets (Q1689999) (← links)
• Maximising the number of cycles in graphs with forbidden subgraphs (Q2222049) (← links)
• The maximum number of cycles in a graph with fixed number of edges (Q2278119) (← links)
• Maximising the number of induced cycles in a graph (Q2399349) (← links)
• The ratio of the numbers of odd and even cycles in outerplanar graphs (Q2685320) (← links)