Domination in Johnson graphs J(n, 3) for odd n
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
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality