Ruth Luo

activity

20162026

most citedBerge cycles in non-uniform hypergraphs

2 citations · 6 across the 16 of their papers we have counts for

collaborators

Showing 2018 · math.COShow all

4 papers · 2 filters

math.CO2018

Avoiding long Berge cycles II, exact bounds for all $n$

Zoltan Furedi, Alexandr Kostochka, Ruth Luo

Let $E G_{r} (n, k)$ denote the maximum number of edges in an $n$ -vertex $r$ -uniform hypergraph with no Berge cycles of length $k$ or longer. In the first part of this work, we have fou…

math.CO2018

On $r$ -uniform hypergraphs with circumference less than $r$

Alexandr Kostochka, Ruth Luo

We show that for each $k \geq 4$ and $n > r \geq k + 1$ , every $n$ -vertex $r$ -uniform hypergraph with no Berge cycle of length at least $k$ has at most $\frac{( k - 1 ) ( n - 1 )}{r}$ edges. The…

math.CO2018

Avoiding long Berge cycles

Zoltan Furedi, Alexandr Kostochka, Ruth Luo

Let $n \geq k \geq r + 3$ and $H$ be an $n$ -vertex $r$ -uniform hypergraph. We show that if $∣ H ∣ > \frac{n - 1}{k - 2} (r k - 1)$ then $H$ contains a Berge cyc…

math.CO2018

A variation of a theorem by Pósa

Zoltan Furedi, Alexandr Kostochka, Ruth Luo

A graph $G$ is $ℓ$ -hamiltonian if for any linear forest $F$ of $G$ with $ℓ$ edges, $F$ can be extended to a hamiltonian cycle of $G$ . We give a sharp upper bound for the maxi…

Avoiding long Berge cycles II, exact bounds for all n

On r-uniform hypergraphs with circumference less than r

Avoiding long Berge cycles

A variation of a theorem by Pósa

Avoiding long Berge cycles II, exact bounds for all $n$

On $r$ -uniform hypergraphs with circumference less than $r$