G. Sárközy

activity

19962019

most citedPartitioning 2-edge-colored graphs by monochromatic paths and cycles

35 citations · 56 across the 9 of their papers we have counts for

collaborators

Showing 1996Show all

2 papers · 1 filter

math.CO1996

An Algorithmic Version of the Blow-up Lemma

János Komlós, Gabor N. Sarkozy, Endre Szemerédi

Recently we have developed a new method in graph theory based on the Regularity Lemma. The method is applied to find certain spanning subgraphs in dense graphs. The other main gene…

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…

An Algorithmic Version of the Blow-up Lemma

On k-ordered Hamiltonian Graphs

On $k$ -ordered Hamiltonian Graphs