Ruth Luo

According to our database, Ruth Luo authored at least 22 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

A Hypergraph Analog of Dirac's Theorem for Long Cycles in 2-Connected Graphs.

Alexandr V. Kostochka, Ruth Luo, Grace McCourt

Comb., August, 2024

Dirac-type theorems for long Berge cycles in hypergraphs.

Alexandr V. Kostochka, Ruth Luo, Grace McCourt

J. Comb. Theory B, 2024

On a property of 2-connected graphs and Dirac's Theorem.

Alexandr V. Kostochka, Ruth Luo, Grace McCourt

Discret. Math., 2024

2023

Minimum degree ensuring that a hypergraph is hamiltonian-connected.

Alexandr V. Kostochka, Ruth Luo, Grace McCourt

Eur. J. Comb., December, 2023

Induced Turán problems and traces of hypergraphs.

Zoltán Füredi, Ruth Luo

Eur. J. Comb., June, 2023

2022

Longest cycles in 3-connected hypergraphs and bipartite graphs.

Alexandr V. Kostochka, Mikhail Lavrov, Ruth Luo, Dara Zirlin

J. Graph Theory, 2022

Towards the Small Quasi-Kernel Conjecture.

Alexandr V. Kostochka, Ruth Luo, Songling Shan

Electron. J. Comb., 2022

2021

Forbidding $K_{2, t}$ Traces in Triple Systems.

Ruth Luo, Sam Spiro

Electron. J. Comb., 2021

Conditions for a Bigraph to be Super-Cyclic.

Alexandr V. Kostochka, Mikhail Lavrov, Ruth Luo, Dara Zirlin

Electron. J. Comb., 2021

Large Monochromatic Components in Almost Complete Graphs and Bipartite Graphs.

Zoltán Füredi, Ruth Luo

Electron. J. Comb., 2021

2020

Super-pancyclic hypergraphs and bipartite graphs.

Alexandr V. Kostochka, Ruth Luo, Dara Zirlin

J. Comb. Theory B, 2020

On r-uniform hypergraphs with circumference less than r.

Alexandr V. Kostochka, Ruth Luo

Discret. Appl. Math., 2020

Berge Cycles in Non-Uniform Hypergraphs.

Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo

Electron. J. Comb., 2020

2019

Avoiding long Berge cycles.

Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo

J. Comb. Theory B, 2019

A variation of a theorem by Pósa.

Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo

Discret. Math., 2019

On 2-Connected Hypergraphs with No Long Cycles.

Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo

Electron. J. Comb., 2019

2018

Extensions of a theorem of Erdős on nonhamiltonian graphs.

Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo

J. Graph Theory, 2018

The maximum number of cliques in graphs without long cycles.

Ruth Luo

J. Comb. Theory B, 2018

Stability in the Erdős-Gallai Theorem on cycles and paths, II.

Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo, Jacques Verstraëte

Discret. Math., 2018

A forest building process on simple graphs.

Zhanar Berikkyzy, Steve Butler, Jay Cummings, Kristin Heysse, Paul Horn, Ruth Luo, Brent Moran

Discret. Math., 2018

2017

A stability version for a theorem of Erdős on nonhamiltonian graphs.

Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo

Discret. Math., 2017

2016

Signed Quasi-Clique Merger: A New Clustering Method for Signed Networks with Positive and Negative Edges.

Xingqin Qi, Ruth Luo, Edgar Fuller, Rong Luo, Cun-Quan Zhang

Int. J. Pattern Recognit. Artif. Intell., 2016