The uniform domination conjecture for Steiner triple systems

Let STS(v)STS(v) denote a Steiner triple system of order vv, and let γ(D)\gamma(D) be the domination number of its incidence graph.

Uniform domination conjecture. There exists a function f:NNf:\mathbb{N}\rightarrow\mathbb{N} such that, if DSTS(v)D\in STS(v), then

γ(D)=f(v).\gamma(D)=f(v).

Equivalently, the domination number depends only on the order vv, not on the structure of the Steiner triple system. The conjecture is verified for v15v\leq 15, but remains open in general.

Sources & referencesView supporting material

Primary source

Felix Goldberg, Deepak Rajendraprasad and Rogers Mathew, “Domination in designs”, arXiv:1405.3436 (2014).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.