Concepedia

Gábor N. Sárközy

GN

51

Publications

1.8K

Citations

25

H-Index

1995

Active since

Affiliations

Worcester Polytechnic Institute(Current)

Hungarian Academy of Sciences

Institute for Computer Science and Control

Rutgers, The State University of New Jersey

Alfréd Rényi Institute of Mathematics

Gábor N. Sárközy is an author at Worcester Polytechnic Institute specializing in graph theory, discrete mathematics, and combinatorial optimization.

Top concepts

Graph TheoryDiscrete MathematicsCombinatorial OptimizationEducationEngineeringNetwork AnalysisComputer ScienceComputational GeometryData MiningData Science

Publications per year

1995–2018

51

Publications

51

Proof of the Seymour conjecture for large graphs

János Komlós, Gábor N. Sárközy, Endre Szemerédi · Annals of Combinatorics · 1998 · 155 citations

Graph Minor, Seymour Conjecture, Graph Theory +4

Proof of the Alon–Yuster conjecture

János Komlós, Gábor N. Sárközy, Endre Szemerédi · Discrete Mathematics · 2001 · 138 citations

Geometry Of Number, Algebraic Combinatorics, Alon–yuster Conjecture

An algorithmic version of the blow-up lemma

Gábor N. Sárközy, Endre Szemerédi · Random Structures and Algorithms · 1998 · 85 citations

An improved bound for the monochromatic cycle partition number

András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy et al. · Journal of Combinatorial Theory Series B · 2006 · 84 citations

Graph Theory, Combinatorial Design Theory, Enumerative Combinatorics +4

Three-Color Ramsey Numbers For Paths

András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy et al. · COMBINATORICA · 2007 · 73 citations

Three-color Ramsey Numbers, Graph Theory, Extremal Graph Theory +5

Rows per page

1–5 of 51