Concepedia

Miklós Ruszinkó

MR

26

Publications

900

Citations

15

H-Index

1994

Active since

Affiliations

Hungarian Academy of Sciences(Current)

Institute for Computer Science and Control

Alfréd Rényi Institute of Mathematics

Worcester Polytechnic Institute

Rutgers, The State University of New Jersey

Miklós Ruszinkó is an author at Hungarian Academy of Sciences specializing in discrete mathematics, engineering, and graph theory.

Top concepts

EngineeringDiscrete MathematicsGraph TheoryCombinatorial OptimizationComputer ScienceNetwork AnalysisEducationComputational GeometryComputational ComplexityNetwork Science

Publications per year

1994–2018

26

Publications

26

On the upper bound of the size of the r-cover-free families

Miklós Ruszinkó · Journal of Combinatorial Theory Series A · 1994 · 202 citations · Full text

Combinatorial Design, Extremal Set Theory, Combinatorial Design Theory +4

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

Three-color Ramsey numbers for paths

András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy et al. · COMBINATORICA · 2008 · 72 citations · Full text

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

Codes identifying sets of vertices in random networks

Alan Frieze, Ryan R. Martin, Julien Moncel et al. · Discrete Mathematics · 2006 · 53 citations

Network Science, Graph Theory, Engineering +8

Rows per page

1–5 of 26