Dominik K. Vu

most cited2-Colored Matchings in a 3-Colored K^{3}_{12}

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

collaborators

3 papers

math.CO2015★ 1 cited

Generalising separating families of fixed size

Fabrício S. Benevides, Dániel Gerbner, Cory T. Palmer +1

We examine the following version of a classic combinatorial search problem introduced by Rényi: Given a finite set $X$ of $n$ elements we want to identify an unknown subset $Y \sub…

math.CO2015★ 1 cited

Extremal properties of flood-filling games

Kitty Meeks, Dominik K. Vu

The problem of determining the number of "flooding operations" required to make a given coloured graph monochromatic in the one-player combinatorial game Flood-It has been studied…

math.CO2012★ 2 cited

2-Colored Matchings in a 3-Colored K^{3}_{12}

Neal Bushaw, Peter Csorba, Lindsay Erickson +5

Let $K_{n}^{r}$ denote the complete $r$ -uniform hypergraph on $n$ vertices. A matching $M$ in a hypergraph is a set of pairwise vertex disjoint edges. Recent Ramsey-type results re…