The following pages link to Ruth Luo (Q783054):
Displaying 19 items.
- Berge cycles in non-uniform hypergraphs (Q783055) (← links)
- The maximum number of cliques in graphs without long cycles (Q1682216) (← links)
- A forest building process on simple graphs (Q1686006) (← links)
- Stability in the Erdős-Gallai theorem on cycles and paths. II (Q1709520) (← links)
- Large monochromatic components in almost complete graphs and bipartite graphs (Q2034067) (← links)
- Avoiding long Berge cycles. II: Exact bounds for all \(n\) (Q2041695) (← links)
- Towards the small quasi-kernel conjecture (Q2088687) (← links)
- Super-pancyclic hypergraphs and bipartite graphs (Q2200932) (← links)
- Conditions for a bigraph to be super-cyclic (Q2223452) (← links)
- On \(r\)-uniform hypergraphs with circumference less than \(r\) (Q2309554) (← links)
- Avoiding long Berge cycles (Q2312601) (← links)
- On 2-connected hypergraphs with no long cycles (Q2335701) (← links)
- A stability version for a theorem of Erdős on nonhamiltonian graphs (Q2401804) (← links)
- A variation of a theorem by Pósa (Q2421858) (← links)
- Forbidding \(K_{2,t}\) traces in triple systems (Q2662345) (← links)
- Extensions of a theorem of Erdős on nonhamiltonian graphs (Q4553734) (← links)
- Longest cycles in 3‐connected hypergraphs and bipartite graphs (Q6057665) (← links)
- Minimum degree ensuring that a hypergraph is Hamiltonian-connected (Q6080369) (← links)
- Induced Turán problems and traces of hypergraphs (Q6116407) (← links)
