Pages that link to "Item:Q898130"

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

Displaying 13 items.

• Cycle-maximal triangle-free graphs (Q472981) (← links)
• Triangle-free subgraphs of powers of cycles (Q1196562) (← links)
• Proof of Komlós's conjecture on Hamiltonian subsets (Q1689999) (← links)
• The number of 4-cycles in triangle-free oriented graphs (Q1897447) (← links)
• The maximum number of induced open triangles in graphs of a given order (Q2010145) (← 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)
• Further notes on: Largest triangle-free subgraphs in powers of cycles (Q2713605) (← links)
• On maximal triangle‐free graphs (Q4309986) (← links)
• (Q4347896) (← links)
• (Q5144372) (← links)