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 2013 · math.COShow all

6 papers · 2 filters

math.CO2013

Rainbow Connection of Random Regular Graphs

Andrzej Dudek, Alan Frieze, Charalampos Tsourakakis

An edge colored graph $G$ is rainbow edge connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph $G$ , d…

math.CO2013

Maker-Breaker games on random geometric graphs

Andrew Beveridge, Andrzej Dudek, Alan Frieze +2

In a Maker-Breaker game on a graph $G$ , Breaker and Maker alternately claim edges of $G$ . Maker wins if, after all edges have been claimed, the graph induced by his edges has some…

math.CO2013

On generalized Ramsey numbers of Erdős and Rogers

Andrzej Dudek, Troy Retter, Vojta Rödl

Extending the concept of Ramsey numbers, Erd{\H o}s and Rogers introduced the following function. For given integers $2 \leq s < t$ let $$ f_{s,t}(n)=\min \{\max \{|W| : W\subseteq V(G…

math.CO2013★ 3 cited

On generalized Ramsey numbers for 3-uniform hypergraphs

Andrzej Dudek, Dhruv Mubayi

The well-known Ramsey number $r (t, u)$ is the smallest integer $n$ such that every $K_{t}$ -free graph of order $n$ contains an independent set of size $u$ . In other words, it contains…

math.CO2013★ 8 cited

Loose Hamilton Cycles in Regular Hypergraphs

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

We establish a relation between two uniform models of random $k$ -graphs (for constant $k \geq 3$ ) on $n$ labeled vertices: $H (n, m)$ , the random $k$ -graph with exactly $m$ edges, and…

math.CO2013★ 19 cited

Approximate counting of regular hypergraphs

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

In this paper we asymptotically count $d$ -regular $k$ -uniform hypergraphs on $n$ vertices, provided $k$ is fixed and $d = d (n) = o (n^{1/2})$ . In doing so, we extend to hypergraphs a sw…