Gábor N. Sárközy

Q: What Schools Are Affiliated With Gábor N. Sárközy

Gábor N. Sárközy is affiliated with the following schools: Worcester Polytechnic Institute, Eötvös Loránd University, Budapest University of Technology and Economics

Gábor N. Sárközy's AcademicInfluence.com Rankings

Gábor N. Sárközy

Mathematics

#3609

World Rank

#5300

Historical Rank

Combinatorics

#109

World Rank

#117

Historical Rank

Number Theory

#136

World Rank

#179

Historical Rank

Measure Theory

#4116

World Rank

#4851

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Gábor N. Sárközy's Degrees

PhD Mathematics Eötvös Loránd University

Why Is Gábor N. Sárközy Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Gábor N. Sárközy, also known as Gabor Sarkozy, is a Hungarian-American mathematician, the son of noted mathematician András Sárközy. He is currently on faculty of the Computer Science Department at Worcester Polytechnic Institute, MA, United States and is also a senior research fellow at the Alfréd Rényi Institute of Mathematics of the Hungarian Academy of Sciences.

(See a Problem?)

Gábor N. Sárközy's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Blow-up Lemma (1997) (311)
Proof of the Alon-Yuster conjecture (2001) (144)
Proof of the Seymour conjecture for large graphs (1998) (140)
An algorithmic version of the blow-up lemma (1996) (97)
On the square of a Hamiltonian cycle in dense graphs (1996) (95)
Three-Color Ramsey Numbers For Paths (2007) (93)
An improved bound for the monochromatic cycle partition number (2006) (87)
On the Pósa-Seymour conjecture (1998) (77)
On k-ordered Hamiltonian graphs (1996) (70)
Ramsey‐type results for Gallai colorings (2010) (66)
Proof of a Packing Conjecture of Bollobás (1995) (64)
How to avoid using the Regularity Lemma: Pósa's conjecture revisited (2010) (60)
Spectral Clustering in Educational Data Mining (2011) (50)
Partitioning 3-Colored Complete Graphs into Three Monochromatic Cycles (2011) (46)
Three-color Ramsey numbers for paths (2008) (45)
Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs (2008) (43)
Gallai colorings of non-complete graphs (2010) (38)
Partitioning 2-edge-colored graphs by monochromatic paths and cycles (2014) (38)
Tripartite Ramsey numbers for paths (2007) (36)
Clustered Knowledge Tracing (2012) (36)
An Extension Of The Ruzsa-Szemerédi Theorem (2004) (36)
Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp (2012) (35)
The Ramsey Number of Diamond-Matchings and Loose Cycles in Hypergraphs (2008) (32)
Monochromatic cycle partitions of edge‐colored graphs (2011) (32)
Rainbow matchings in bipartite multigraphs (2015) (30)
On the number of Hamiltonian cycles in Dirac graphs (2003) (27)
Spanning Trees in Dense Graphs (2001) (27)
On cycles in the coprime graph of integers (1996) (27)
Monochromatic Path and Cycle Partitions in Hypergraphs (2013) (25)
On a Turán-type hypergraph problem of Brown, Erdos and T. Sós (2005) (24)
On Edge Colorings with at Least q Colors in Every Subset of p Vertices (2000) (22)
Interactive Time Series Exploration Powered by the Marriage of Similarity Distances (2016) (22)
Ramsey-type results for Gallai colorings (2010) (20)
The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle (2010) (20)
Distributing vertices along a Hamiltonian cycle in Dirac graphs (2008) (19)
Cycles in bipartite graphs and an application in number theory (1995) (18)
Rainbow matchings and cycle-free partial transversals of Latin squares (2014) (17)
Improved monochromatic loose cycle partitions in hypergraphs (2014) (17)
Size of Monochromatic Double Stars in Edge Colorings (2008) (17)
One-sided Coverings of Colored Complete Bipartite Graphs (2006) (17)
Complete tripartite subgraphs in the coprime graph of integers (1999) (17)
Generalized Dynamic Time Warping: Unleashing the Warping Power Hidden in Point-Wise Distances (2018) (16)
On the Multi-Colored Ramsey Numbers of Paths and Even Cycles (2016) (16)
Monochromatic bounded degree subgraph partitions (2014) (15)
Long rainbow cycles in proper edge-colorings of complete graphs (2011) (15)
Long Monochromatic Berge Cycles in Colored 4-Uniform Hypergraphs (2010) (15)
Monochromatic Matchings in the Shadow Graph of Almost Complete Hypergraphs (2010) (15)
Vertex Partitions by Connected Monochromatic k-Regular Graphs (2000) (15)
Stability of the path-path Ramsey number (2009) (14)
Monochromatic Loose-cycle Partitions in Hypergraphs (2014) (14)
Co-Clustering by Bipartite Spectral Graph Partitioning for Out-of-Tutor Prediction (2012) (14)
An Improved Bound for Vertex Partitions by Connected Monochromatic K‐Regular Graphs (2013) (14)
An application of the regularity lemma in generalized Ramsey theory (2003) (13)
A Practical Regularity Partitioning Algorithm and its Applications in Clustering (2012) (13)
Coverings by Few Monochromatic Pieces: A Transition Between Two Ramsey Problems (2013) (13)
A fast parallel algorithm for finding Hamiltonian cycles in dense graphs (2009) (13)
Large Monochromatic Components in Edge Colored Graphs with a Minimum Degree Condition (2017) (12)
Size of monochromatic components in local edge colorings (2008) (11)
Monochromatic Hamiltonian 3‐tight Berge cycles in 2‐colored 4‐uniform hypergraphs (2010) (11)
Inequalities for the first‐fit chromatic number (2008) (10)
On 2-factors with k components (2008) (10)
Monochromatic Hamiltonian t‐tight Berge‐cycles in hypergraphs (2008) (9)
Induced Colorful Trees and Paths in Large Chromatic Graphs (2016) (8)
Ramsey numbers for bipartite graphs with small bandwidth (2015) (8)
Partitioning 2‐Edge‐Colored Ore‐Type Graphs by Monochromatic Cycles (2016) (8)
Interactive Time Series Analytics Powered by ONEX (2017) (8)
Large monochromatic components in multicolored bipartite graphs (2018) (8)
Inequalities for the first-fit chromatic number (2008) (7)
Multipartite Ramsey numbers for odd cycles (2009) (7)
Linear Turán numbers of acyclic triple systems (2022) (6)
Turán and Ramsey numbers in linear triple systems (2020) (6)
Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs (2010) (6)
On a question of Gowers concerning isosceles right-angle triangles (2003) (6)
Partitioning edge-2-colored graphs by monochromatic paths and cycles (2012) (6)
On sums with small prime factors (1995) (5)
On a problem of P. Erdős (1992) (5)
Vertex partitions of non-complete graphs into connected monochromatic k-regular graphs (2011) (4)
Monochromatic cycle power partitions (2017) (4)
Monochromatic Hamiltonian t-tight Berge-cycles in hypergraphs (2008) (4)
A quantitative version of the Blow-up Lemma (2014) (4)
On bipartite generalized Ramsey theory (2003) (4)
Ramsey Number of a Connected Triangle Matching (2015) (3)
Applying Clustering to the Problem of Predicting Retention within an ITS: Comparing Regularity Clustering with Traditional Methods (2013) (3)
Monochromatic Partitions In Local Edge Colorings (2020) (2)
The linear Turán number of small triple systems or why is the wicket interesting? (2022) (2)
On an anti‐Ramsey problem of Burr, Erdős, Graham, and T. Sós (2006) (2)
Matchings with few colors in colored complete graphs and hypergraphs (2020) (2)
On an anti-Ramsey problem of Burr, Erdõs, Graham, and T. Sós (2006) (2)
Ramsey number of paths and connected matchings in Ore-type host graphs (2016) (2)
A General Approach for Supporting Time Series Matching Using Multiple-Warped Distances (2020) (1)
On the size of partial block designs with large blocks (2005) (1)
Coverings by Few Monochromatic Pieces: A Transition Between Two Ramsey Problems (2013) (1)
Sárközy Partitioning 2-edge-colored Ore-type graphs by monochromatic cycles 2014 (2017) (1)
Ramsey numbers of path-matchings, covering designs, and 1-cores (2019) (1)
Cliques in $$C_4$$C4-free graphs of large minimum degree (2015) (1)
Partitioning 2-edge-colored graphs by monochromatic paths and cycles (2014) (1)
Predicting Long Term Student Retention using Expanded PFA and Clustering (2012) (0)
DNA Computation to solve the Hitting String Problem (1998) (0)
Optical Character Recognition (2006) (0)
Coverings by monochromatic pieces-problems for the Emléktábla workshop (2011) (0)
Nearest Neighbor Subsequence Search in Time Series Data (2019) (0)
Improved Monochromatic Double Stars in Edge Colorings (2022) (0)
C O ] 1 4 A ug 2 01 8 Monochromatic balanced components , matchings , and paths in multicolored complete bipartite graphs (2018) (0)
WPI-CS-TR-12-05 September 2012 A Practical Regularity Partitioning (2013) (0)
On the Regularity Method (2008) (0)
Improved Monochromatic Double Stars in Edge Colorings (2022) (0)
Rainbow matchings in bipartite multigraphs (2016) (0)
Monochromatic square-cycle and square-path partitions (2022) (0)
Cloud Vulnerability Assessment a Major Qualifying Project (0)
Monochromatic covers in local edge colorings (2019) (0)
Monochromatic Partitions In Local Edge Colorings (2020) (0)
New ordering methods to construct contagious sets and induced degenerate subgraphs (2023) (0)
Counting irregular multigraphs (1999) (0)

This paper list is powered by the following services:

Other Resources About Gábor N. Sárközy

en.wikipedia.org

What Schools Are Affiliated With Gábor N. Sárközy?

Gábor N. Sárközy is affiliated with the following schools:

Gábor N. Sárközy's Academic­Influence.com Rankings

Gábor N. Sárközy's Degrees

Why Is Gábor N. Sárközy Influential?

Gábor N. Sárközy's Published Works

Published Works

Other Resources About Gábor N. Sárközy

What Schools Are Affiliated With Gábor N. Sárközy?

Gábor N. Sárközy's AcademicInfluence.com Rankings