2 citations · 6 across the 6 of their papers we have counts for
13 papers
Large monochromatic components in almost complete graphs and bipartite graphs
Zoltan Furedi, Ruth Luo
Gyárfas proved that every coloring of the edges of with colors contains a monochromatic connected component of size at least . Later, Gyárfás and Sárközy asked for…
Forbidding traces in triple systems
Ruth Luo, Sam Spiro
Let and be hypergraphs. We say contains as a trace if there exists some set such that contains a subhypergraph is…
Conditions for a bigraph to be super-cyclic
Alexandr Kostochka, Mikhail Lavrov, Ruth Luo +1
A hypergraph is super-pancyclic if for each with , contains a Berge cycle with base vertex set . We present two…
Longest cycles in 3-connected hypergraphs and bipartite graphs
Alexandr Kostochka, Mikhail Lavrov, Ruth Luo +1
In the language of hypergraphs, our main result is a Dirac-type bound: we prove that every -connected hypergraph with has a h…
Induced Turán problems and traces of hypergraphs
Zoltan Furedi, Ruth Luo
Let be a graph. We say that a hypergraph contains an induced Berge if the vertices of can be embedded to (e.g., ) and there exists an inject…
Berge cycles in non-uniform hypergraphs
Zoltan Furedi, Alexandr Kostochka, Ruth Luo
We consider two extremal problems for set systems without long Berge cycles. First we give Dirac-type minimum degree conditions that force long Berge cycles. Next we give an upper…