S. Selkow

most citedCoverings by few monochromatic pieces - a transition between two Ramsey problems

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

collaborators

2 papers

math.CO2013★ 2 cited

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…

math.CO1996

On $k$ -ordered Hamiltonian Graphs

Gabor N. Sarkozy, Stanley Selkow

A Hamiltonian graph $G$ of order $n$ is $k$ -ordered, $2 \leq k \leq n$ , if for every sequence $v_{1}, v_{2}, \dots, v_{k}$ of $k$ distinct vertices of $G$ , there exists a Hamiltonian cyc…

Coverings by few monochromatic pieces - a transition between two Ramsey problems

On k-ordered Hamiltonian Graphs

On $k$ -ordered Hamiltonian Graphs