Martin Rolek

activity

20162025

most citedFat-triangle linkage and kite-linked graphs

2 citations · 4 across the 7 of their papers we have counts for

collaborators

Showing 2018Show all

4 papers · 1 filter

math.CO2018

Minimum degree condition for a graph to be knitted

Runrun Liu, Martin Rolek, Gexin Yu

For a positive integer $k$ , a graph is $k$ -knitted if for each $k$ -subset $S$ of vertices, and every partition of $S$ into disjoint parts $S_{1}, \dots, S_{t}$ for some $t \geq 1$ , one…

math.CO2018

DP-3-coloring of planar graphs without $4, 9$ -cycles and two cycles from ${5, 6, 7, 8}$

Runrun Liu, Sarah Loeb, Martin Rolek +2

A generalization of list-coloring, now known as DP-coloring, was recently introduced by Dvořák and Postle. Essentially, DP-coloring assigns an arbitrary matching between lists of c…

math.CO2018

The extremal function for $K_{9}^{=}$ minors

Martin Rolek

We prove the extremal function for $K_{9}^{=}$ minors, where $K_{9}^{=}$ denotes the complete graph $K_{9}$ with two edges removed. In particular, we show that any graph with $n$ vertices an…

math.CO2018

Saturation numbers for Ramsey-minimal graphs

Martin Rolek, Zi-Xia Song

Given graphs $H_{1}, \dots, H_{t}$ , a graph $G$ is $(H_{1}, \dots, H_{t})$ -Ramsey-minimal if every $t$ -coloring of the edges of $G$ contains a monochromatic $H_{i}$ in color $i$ for some $i\…

Minimum degree condition for a graph to be knitted

DP-3-coloring of planar graphs without 4,9-cycles and two cycles from {5,6,7,8}

The extremal function for K9=​ minors

Saturation numbers for Ramsey-minimal graphs

DP-3-coloring of planar graphs without $4, 9$ -cycles and two cycles from ${5, 6, 7, 8}$

The extremal function for $K_{9}^{=}$ minors