activity
20002009
most citedDense Edge-Magic Graphs and Thin Additive Bases

3 citations · 5 across the 9 of their papers we have counts for

collaborators
Showing 2009Show all

2 papers · 1 filter

math.CO2009

Finding an Unknown Acyclic Orientation of a Given Graph

Oleg Pikhurko

Let c(G) be the smallest number of edges we have to test in order to determine an unknown acyclic orientation of the given graph G in the worst case. For example, if G is the compl…

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…