Domination in Johnson graphs J(n, 3) for odd n

arXiv:2606.10326 · math.CO · Submitted 2026-06-09 · Read on arXiv

math.CO

Submitted: 2026-06-09

Updated: 2026-11-05

Comments: 18 pages. v3: adds the lower-bound argument of Füredi, Székely, and Zubor (1996); attributes the extremal structure for odd n >= 13 to Brouwer (1981, Theorem 2); shortens the proof of Lemma 2.4. v2: acknowledges that the result follows from earlier work of Bate (1978) and Brouwer (1981) on lotto designs; corrects several statements about prior work

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

Related papers