The following pages link to A variation of a theorem by Pósa (Q2421858):
Displaying 5 items.
- Maximizing the number of cliques in graphs with given matching number (Q2004083) (← links)
- On 2-connected hypergraphs with no long cycles (Q2335701) (← links)
- (Q3714233) (← links)
- Extensions of a theorem of Erdős on nonhamiltonian graphs (Q4553734) (← links)
- The Turán number of Berge hypergraphs with stable properties (Q6056469) (← links)