Ruth Luo

activity

20162026

most citedOn

r

-uniform hypergraphs with circumference less than

r

19 citations · 59 across the 25 of their papers we have counts for

collaborators

Showing 2017 · math.COShow all

3 papers · 2 filters

math.CO2017

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

Zoltán Füredi, Alexandr Kostochka, Ruth Luo +1

The Erdős--Gallai Theorem states that for $k \geq 3$ , any $n$ -vertex graph with no cycle of length at least $k$ has at most $\frac{1}{2} (k - 1) (n - 1)$ edges. A stronger version of the…

math.CO2017

Extensions of a theorem of Erdős on nonhamiltonian graphs

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

Let $n, d$ be integers with $1 \leq d \leq ⌊ \frac{n - 1}{2} ⌋$ , and set $h (n, d) := (2 n - d) + d^{2}$ . Erdős proved that when $n \geq 6 d$ , each nonhamilto…

math.CO2017★ 5 cited

The maximum number of cliques in graphs without long cycles

Ruth Luo

The Erdős--Gallai Theorem states that for $k \geq 3$ every graph on $n$ vertices with more than $\frac{1}{2} (k - 1) (n - 1)$ edges contains a cycle of length at least $k$ . Kopylov proved…