2 citations · 6 across the 6 of their papers we have counts for
6 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…
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…
Towards the Small Quasi-Kernel Conjecture
Alexandr Kostochka, Ruth Luo, Songling Shan
Let be a digraph. A vertex set is a quasi-kernel of if is an independent set in and for every vertex , is at most distan…
On 2-connected hypergraphs with no long cycles
Zoltan Furedi, Alexandr Kostochka, Ruth Luo
We give an upper bound for the maximum number of edges in an -vertex 2-connected -uniform hypergraph with no Berge cycle of length or greater, where $n\geq k \geq 4r\geq…