M. Ruszinkó

activity

20142024

most citedA modified bootstrap percolation on a random graph coupled with a lattice

13 citations · 21 across the 5 of their papers we have counts for

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2024★ 5 cited

Proper edge colorings of planar graphs with rainbow $C_{4}$ -s

András Gyárfás, Ryan R. Martin, Miklós Ruszinkó +1

We call a proper edge coloring of a graph $G$ a B-coloring if every 4-cycle of $G$ is colored with four different colors. Let $q_{B} (G)$ denote the smallest number of colors needed f…

math.CO2016★ 3 cited

On randomly generated intersecting hypergraphs II

Tom Bohman, Alan Frieze, Ryan R. Martin +2

Let $c$ be a positive constant. Suppose that $r = o (n^{5/12})$ and the members of $(r [ n ])$ are chosen sequentially at random to form an intersecting hypergraph $H$ .…

math.CO2016

On randomly generated intersecting hypergraphs

Tom Bohman, Colin Cooper, Alan Frieze +2

Let $c$ be a positive constant. We show that if $r = ⌊ c n^{1/3} ⌋$ and the members of $(r [ n ])$ are chosen sequentially at random to form an intersecting hypergraph…

math.CO2015★ 13 cited

A modified bootstrap percolation on a random graph coupled with a lattice

Svante Janson, Robert Kozma, Miklós Ruszinkó +1

In this paper a random graph model $G_{Z_{N}^{2}, p_{d}}$ is introduced, which is a combination of fixed torus grid edges in $(Z / N Z)^{2}$ and some additional ran…

Proper edge colorings of planar graphs with rainbow C4​-s

On randomly generated intersecting hypergraphs II

On randomly generated intersecting hypergraphs

A modified bootstrap percolation on a random graph coupled with a lattice

Proper edge colorings of planar graphs with rainbow $C_{4}$ -s