Miklós Ruszinkó

Available identifiers

zbMath Open ruszinko.miklosMaRDI QIDQ228772

List of research outcomes

Publication	Date of Publication	Type
Large monochromatic components of small diameter	2023-10-04	Paper
Linear Turán numbers of acyclic triple systems	2021-10-28	Paper
Monochromatic diameter-2 components in edge colorings of the complete graph	2021-10-18	Paper
Monochromatic balanced components, matchings, and paths in multicolored complete bipartite graphs	2019-11-18	Paper
A modified bootstrap percolation on a random graph coupled with a lattice	2019-03-22	Paper
Uniform hypergraphs containing no grids	2014-01-08	Paper
Large components in r-edge-colorings of Kn have diameter at most five	2012-06-13	Paper
https://portal.mardi4nfdi.de/entity/Q3101000	2011-11-22	Paper
Partitioning 3-colored complete graphs into three monochromatic cycles	2011-06-01	Paper
Three-color Ramsey numbers for paths	2009-07-20	Paper
Corrigendum. Three-color Ramsey numbers for paths	2009-01-20	Paper
Single-User Tracing and Disjointly Superimposed Codes	2008-12-21	Paper
Large convex cones in hypercubes	2008-09-29	Paper
Tripartite Ramsey numbers for paths	2007-06-11	Paper
On the Maximum Size of (p, Q)—free Families	2007-05-29	Paper
Large Convex Cones in Hypercubes	2007-05-29	Paper
Codes identifying sets of vertices in random networks	2007-03-15	Paper
https://portal.mardi4nfdi.de/entity/Q3424732	2007-03-05	Paper
https://portal.mardi4nfdi.de/entity/Q3424878	2007-03-05	Paper
Randomly generated intersecting hypergraphs II	2007-02-07	Paper
An improved bound for the monochromatic cycle partition number	2007-01-16	Paper
On randomly generated intersecting hypergraphs	2003-09-24	Paper
Anti-Ramsey colorings in several rounds	2002-12-10	Paper
On the maximum size of \((p,Q)\)-free families	2002-12-02	Paper
G-Intersecting Families	2002-11-24	Paper
Vertex covers by edge disjoint cliques	2002-02-13	Paper
https://portal.mardi4nfdi.de/entity/Q4521485	2000-12-19	Paper
A note on random minimum length spanning trees	2000-09-14	Paper
A note on sparse random graphs and cover graphs	2000-04-16	Paper
An improved upper bound of the rate of Euclidean superimposed codes	1999-11-21	Paper
How to decrease the diameter of triangle-free graphs	1999-10-31	Paper
Short certificates for tournaments	1998-02-12	Paper
On a search problem in multidimensional grids	1997-11-24	Paper
Intersecting Systems	1997-09-28	Paper
How an Erdos-Renyi-type search approach gives an explicit code construction of rate 1 for random access with multiplicity feedback	1997-05-12	Paper
On a 2-dimensional search problem	1995-01-31	Paper
On the upper bound of the size of the \(r\)-cover-free families	1994-10-20	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Miklós Ruszinkó