A. Dudek

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2011

On the Maximum Number of Edges in a Hypergraph with a Unique Perfect Matching

Deepak Bal, Andrzej Dudek, Zelealem B. Yilma

In this note, we determine the maximum number of edges of a $k$ -uniform hypergraph, $k \geq 3$ , with a unique perfect matching. This settles a conjecture proposed by Snevily.

math.CO2011

Tight Hamilton Cycles in Random Uniform Hypergraphs

Andrzej Dudek, Alan Frieze

In this paper we show that $e / n$ is the sharp threshold for the existence of tight Hamilton cycles in random $k$ -uniform hypergraphs, for all $k \geq 4$ . When $k = 3$ we show that $1/n…

math.CO2009

Flips in Graphs

Tom Bohman, Andrzej Dudek, Alan Frieze +1

We study a problem motivated by a question related to quantum-error-correcting codes. Combinatorially, it involves the following graph parameter: $$f(G)=\min\set{|A|+|\{x\in V\setm…