2 citations · 5 across the 4 of their papers we have counts for
7 papers
Crowns in linear -graphs
Alvaro Carbonero, Willem Fletcher, Jing Guo +3
A \textit{linear -graph}, , is a set, , of vertices together with a set, , of -element subsets of , called edges, so that any two distinct edges intersec…
Turán number of special four cycles in triple systems
Zoltán Füredi, András Gyárfás, Attila Sali
A {\em special four-cycle } in a triple system consists of four triples {\em inducing } a . This means that has four special vertices and four triple…
Covering 2-colored complete digraphs by monochromatic -dominating digraphs
Louis DeBiasio, András Gyárfás
A digraph is {\em -dominating} if every set of at most vertices has a common out-neighbor. For all integers , let be the smallest integer such that the verti…
Partitioning the power set of into -free parts
Eben Blaisdell, András Gyárfás, Robert A. Krueger +1
We show that for , in any partition of , the set of all subsets of , into parts, some part must contain a triangl…
Monochromatic balanced components, matchings, and paths in multicolored complete bipartite graphs
Louis DeBiasio, András Gyárfás, Robert A. Krueger +2
It is well-known that in every -coloring of the edges of the complete bipartite graph there is a monochromatic connected component with at least vertices…
Uniquely -saturated Hypergraphs
András Gyárfás, Stephen G. Hartke, Charles Viss
In this paper we generalize the concept of uniquely -saturated graphs to hypergraphs. Let denote the complete -uniform hypergraph on vertices. For integers…