A. Dudek

activity

20092023

most citedAn alternative proof of the linearity of the size-Ramsey number of paths

44 citations · 113 across the 33 of their papers we have counts for

collaborators

Showing 2015Show all

4 papers · 1 filter

math.CO2015

Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs

Patrick Bennett, Andrzej Dudek, Alan Frieze +1

Given an $r$ -uniform hypergraph $H = (V, E)$ and a weight function $ω : E \to {1, \dots, w}$ , a coloring of vertices of $H$ , induced by $ω$ , is defined by $c (v) = \sum_{e ∋ v} w (e)$ for…

math.CO2015★ 11 cited

Embedding the Erdős-Rényi Hypergraph into the Random Regular Hypergraph and Hamiltonicity

Andrzej Dudek, Alan Frieze, Andrzej Ruciński +1

We establish an inclusion relation between two uniform models of random $k$ -graphs (for constant $k \geq 2$ ) on $n$ labeled vertices: $G^{(k)} (n, m)$ , the random $k$ -graph wi…

math.CO2015★ 1 cited

On the size-Ramsey number of hypergraphs

Andrzej Dudek, Steven La Fleur, Dhruv Mubayi +1

The size-Ramsey number of a graph $G$ is the minimum number of edges in a graph $H$ such that every 2-edge-coloring of $H$ yields a monochromatic copy of $G$ . Size-Ramsey numbers o…

math.CO2015

The set chromatic number of random graphs

Andrzej Dudek, Dieter Mitsche, Paweł Prałat

In this paper we study the set chromatic number of a random graph $G (n, p)$ for a wide range of $p = p (n)$ . We show that the set chromatic number, as a function of $p$ , forms an intri…