Gábor N. Sárközy - Concepedia

Author

Gábor N. Sárközy

Also Known As

G. N. Sárközy, G.N. Sárközy, Gabor N. Sarkozy, Gabor Sarkozy, Gyárfás, András, GÁBOR N. SÁRKÓZY, GÁBOR N. SÁRKÖZY, Gábor N. Sárközy, Gábor N. Sárközy†, Gábor Sárközy

118

Publications

2.3K

Citations

H-Index

Concepts

All Affiliations

Worcester Polytechnic Institute Hungarian Academy of Sciences Institute for Computer Science and Control Rutgers, The State University of New Jersey Alfréd Rényi Institute of Mathematics

About

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

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Education	9	9	250
2	Engineering	9	9	298
3	Business	1	1	11
4	Natural Sciences	1	1	23
5	Computer Engineering	1	1	23

Gábor N. Sárközy

Publications

1.8K

Citations

H-Index

Page 1

	Year	Citations
Proof of the Seymour conjecture for large graphs János Komlós, Gábor N. Sárközy, Endre Szemerédi Annals of Combinatorics Graph MinorSeymour ConjectureGraph TheoryAlgebraic Graph TheoryExtremal Graph Theory	1998	155
Proof of the Alon–Yuster conjecture János Komlós, Gábor N. Sárközy, Endre Szemerédi Discrete Mathematics Geometry Of NumberAlgebraic CombinatoricsAlon–yuster Conjecture	2001	138
An algorithmic version of the blow-up lemma Gábor N. Sárközy, Endre Szemerédi Random Structures and Algorithms	1998	85
An improved bound for the monochromatic cycle partition number András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Journal of Combinatorial Theory Series B Graph TheoryCombinatorial Design TheoryEnumerative CombinatoricsImproved BoundDiscrete Mathematics	2006	84
Three-Color Ramsey Numbers For Paths András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, COMBINATORICA Three-color Ramsey NumbersGraph TheoryExtremal Graph TheoryCombinatorial Design TheoryEnumerative Combinatorics	2007	73
Three-color Ramsey numbers for paths András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, COMBINATORICA Three-color Ramsey NumbersGraph TheoryExtremal Graph TheoryCombinatorial Design TheoryEnumerative Combinatorics	2008	72
Spanning Trees in Dense Graphs János Komlós, Gábor N. Sárközy, Endre Szemerédi Combinatorics Probability Computing EngineeringMaximum DegreeN 0Network AnalysisEducation	2001	71
Proof of a Packing Conjecture of Bollobás János Komlós, Gábor N. Sárközy, Endre Szemerédi Combinatorics Probability Computing Geometry Of NumberDiscrete GeometryEngineeringGraph TheoryExtremal Graph Theory	1995	64
Ramsey‐type results for Gallai colorings András Gyárfás, Gábor N. Sárközy, András Sebö, Journal of Graph Theory Ramsey NumbersInformation TheoryGraph TheoryAlgebraic Graph TheoryStructural Graph Theory	2009	59
How to avoid using the Regularity Lemma: Pósa’s conjecture revisited Ian Levitt, Gábor N. Sárközy, Endre Szemerédi Discrete Mathematics Real Algebraic GeometryRegularity LemmaGeometry Of Number	2009	54

Page 1