G
Gábor N. Sárközy
Researcher at Worcester Polytechnic Institute
Publications - 108
Citations - 2766
Gábor N. Sárközy is an academic researcher from Worcester Polytechnic Institute. The author has contributed to research in topics: Bipartite graph & Vertex (geometry). The author has an hindex of 27, co-authored 104 publications receiving 2530 citations. Previous affiliations of Gábor N. Sárközy include Alfréd Rényi Institute of Mathematics & University of Pennsylvania.
Papers
More filters
Journal ArticleDOI
Blow-up Lemma
TL;DR: Regular pairs behave like complete bipartite graphs from the point of view of bounded degree subgraphs.
Journal ArticleDOI
Proof of the Seymour conjecture for large graphs
TL;DR: In this paper, the authors proved that any graphG of ordern and minimum degree of at leastk/k+1n contains the kth power of a Hamiltonian cycle.
Journal ArticleDOI
Proof of the Alon—Yuster conjecture
TL;DR: It is shown that if H has a k-coloring with color-class sizes h1 ⩽h2⩽⋯⦽hk, then the conjecture is true with c(H)=hk+hk−1−1.
Journal ArticleDOI
An improved bound for the monochromatic cycle partition number
TL;DR: Improving a result of Erdos, Gyarfas and Pyber for large n, it is shown that for every integer r>=2 there exists a constant n"0=n"0(r) such that if n>=n"-0 and the edges of the complete graph K"n are colored with r colors then the vertex set of K" n can be partitioned into at most 100rlogr vertex disjoint monochromatic cycles.
Journal ArticleDOI
On the square of a Hamiltonian cycle in dense graphs
TL;DR: In this article, it was shown that any graph G of order n and minimum degree at least ⅔ n contains the square of a Hamiltonian cycle for sufficiently large n.