35 citations · 136 across the 22 of their papers we have counts for
6 papers · 1 filter
Coloring 2-intersecting hypergraphs
Lucas Colucci, András Gyárfás
A hypergraph is 2-intersecting if any two edges intersect in at least two vertices. Blais, Weinstein and Yoshida asked (as a first step to a more general problem) whether every 2-i…
Problems and memories
András Gyárfás
I state some open problems coming from joint work with Paul Erdős
Complements of nearly perfect graphs
András Gyárfás, Zhentao Li, Raphael Machado +3
A class of graphs closed under taking induced subgraphs is -bounded if there exists a function such that for all graphs in the class, . We consider th…
Coverings by few monochromatic pieces - a transition between two Ramsey problems
András Gyárfás, Gábor N. Sárközy, Stanley Selkow
The typical problem in (generalized) Ramsey theory is to find the order of the largest monochromatic member of a family F (for example matchings, paths, cycles, connected subgraphs…
Multicolor Ramsey numbers for triple systems
Maria Axenovich, Andras Gyarfas, Hong Liu +1
Given an -uniform hypergraph , the multicolor Ramsey number is the minimum such that every -coloring of the edges of the complete -uniform hypergraph $K_n^…
Domination in transitive colorings of tournaments
Dömötör Pálvölgyi, András Gyárfás
An edge coloring of a tournament with colors is called \it -transitive \rm if the digraph defined by the edges of color is transitively oriented for…