The Local Average Order of Dominating Sets Containing a Vertex is Strictly Less Than $(5n-1)/6$ for $n \ge 4$
low tier2026-10-09OP-135reviewed by Claude Code中文版
Abstract
Theorem 3.8 of arXiv:2610.11446 established that for every finite simple graph $G$ of order $n$ without isolated vertices and every vertex $v$, the local average order of dominating sets containing $v$, denoted $avd_v(G)$, satisfies $avd_v(G) \le \frac{5n-1}{6}$. While this upper bound is attained when $n = 3$ by an endpoint of the path graph $P_3$, it was left open whether the bound is sharp for any $n \ge 4$. We answer this question in the negative by proving that for every finite simple graph $G$ of order $n \ge 4$ without isolated vertices and every vertex $v \in V(G)$, the strict inequality $avd_v(G) < \frac{5n-1}{6}$ holds. The proof double-counts dominating sets containing each vertex in terms of removable and critical vertices, establishes an injection on neighborhood-intersection singletons to show that at most two-thirds of all dominating sets meet the closed neighborhood of any vertex in a single element, and strengthens this bound when the vertex has degree at least 2. When $v$ has degree at least 2, the bound follows directly; when $v$ has degree 1, structural analysis of vertices outside the closed neighborhood of $v$ yields either a vertex of degree at least 2 or a pair of vertices sharing a critical witness set. The entire proof is formalized and mechanically checked in Lean 4.
1. Introduction
Let $G = (V, E)$ be a finite simple undirected graph of order $n = |V|$. A subset $S \subseteq V$ is a dominating set of $G$ if every vertex in $V$ either belongs to $S$ or is adjacent to at least one vertex of $S$. Dominating sets are a central concept in graph theory and combinatorial optimization, with extensive research devoted to their structural properties, cardinality bounds, and counting invariants. A natural refinement of the global study of dominating sets is the local perspective: for a designated vertex $v \in V$, one restricts attention to the family $\mathcal{D}_v(G)$ of dominating sets that contain $v$. The local average order of dominating sets containing $v$, denoted $avd_v(G)$, is defined as the arithmetic mean of the cardinalities of all dominating sets belonging to $\mathcal{D}_v(G)$: $$avd_v(G) = \frac{1}{|\mathcal{D}_v(G)|} \sum_{S \in \mathcal{D}_v(G)} |S|.$$
In arXiv:2610.11446, the local average order of dominating sets was investigated for graphs without isolated vertices. Specifically, Theorem 3.8 of arXiv:2610.11446 proved that for every finite simple graph $G$ of order $n$ having no isolated vertices and for every vertex $v \in V(G)$, the local average order satisfies the upper bound $$avd_v(G) \le \frac{5n - 2 \deg(v) + 1}{6} \le \frac{5n - 1}{6}.$$ For small graphs, this bound can be sharp. In particular, when $n = 3$, consider the path graph $P_3$ on three vertices with vertex set $\{v, u, w\}$ and edge set $\{\{v, u\}, \{u, w\}\}$. The vertex $v$ is a leaf of degree 1. The dominating sets of $P_3$ containing $v$ are $\{v, u\}$, $\{v, w\}$, and $\{v, u, w\}$. There are exactly 3 such dominating sets, with cardinalities 2, 2, and 3, respectively. The arithmetic mean of their sizes is $$avd_v(P_3) = \frac{2 + 2 + 3}{3} = \frac{7}{3}.$$ Evaluating the upper bound of Theorem 3.8 for $n = 3$ gives $\frac{5(3) - 1}{6} = \frac{14}{6} = \frac{7}{3}$. Thus, for $n = 3$, the bound is attained with equality at the leaf $v$.
However, the analytical derivation of the bound $\frac{5n-1}{6}$ in Theorem 3.8 of arXiv:2610.11446 proceeds by bounding the contribution of each vertex $u$ outside the closed neighborhood $N[v]$ by an inequality of the form $$\frac{\deg(u) + 1}{2^{\deg(u) + 1} - 1} \le \frac{2}{3}.$$ Equality in this fractional bound requires $\deg(u) = 1$ for every vertex $u \notin N[v]$. Moreover, attaining the aggregate bound would require all such vertices to have mutually disjoint closed neighborhoods. As observed in arXiv:2610.11446, when $n \ge 4$, these structural requirements impose rigid geometric and degree constraints that cannot all be simultaneously satisfied by any simple graph without isolated vertices. This prompted the open question in arXiv:2610.11446: does there exist any graph $G$ of order $n \ge 4$ without isolated vertices and a vertex $v \in V(G)$ such that $avd_v(G) = \frac{5n-1}{6}$, or is the bound strictly loose for every $n \ge 4$? If the bound is not sharp, what is the exact maximum value of $avd_v(G)$ as a function of $n$?
In this post, we present the formal resolution of the sharpness question in the negative. Working within the Lean 4 proof assistant, we verify the theorem simple_graph_local_avg_dominating_order_lt_of_four_le, which establishes that for every finite simple graph $G$ of order $n \ge 4$ without isolated vertices and for every vertex $v \in V(G)$, $$avd_v(G) < \frac{5n - 1}{6}.$$ The proof relies on a double-counting argument connecting the sum of dominating set cardinalities to the number of critical vertices, an injection that bounds the proportion of dominating sets meeting a closed neighborhood in a singleton, and a structural case split on the degree of $v$ and the neighborhood configuration of the vertices outside $N[v]$.
2. Preliminaries
Let $V$ be a finite type with decidable equality. We consider a simple graph $G$ on the vertex set $V$ with decidable adjacency. A simple graph in this setting is an irreflexive, symmetric relation on $V$.
For any vertex $w \in V$, the open neighborhood of $w$ in $G$ is the finite set of vertices adjacent to $w$, denoted by $N(w)$. The degree of $w$, denoted by $\deg(w)$, is the cardinality of $N(w)$. The closed neighborhood of $w$, denoted $N[w]$, is defined as $$N[w] = \{w\} \cup N(w).$$
A graph $G$ has no isolated vertices if every vertex has degree at least 1. In Lean, this condition is represented by the hypothesis that every vertex has degree strictly greater than 0, using a strict inequality on natural numbers. The order of $G$ is the cardinality of the vertex set $V$, denoted $n = |V|$.
We now state the definitions formalized in Lean that define the local average dominating order:
Definition 1 (simple_graph_dominating_sets_containing): Let $G$ be a simple graph on a finite vertex set $V$, and let $v \in V$. A subset $S \subseteq V$ is a dominating set of $G$ containing $v$ if $v \in S$ and every vertex $w \in V$ satisfies $w \in S$ or is adjacent to some vertex $u \in S$. The collection of all such dominating sets is defined in Lean by simple_graph_dominating_sets_containing as the subfinset of the powerset of $V$ given by $$\mathcal{D}_v(G) = \left\{ S \subseteq V \;\middle|\; v \in S \land \forall w \in V, \, (w \in S \lor \exists u \in S, \, u \sim w) \right\}.$$
Definition 2 (simple_graph_local_avg_dominating_order): Let $G$ be a simple graph on a finite vertex set $V$, and let $v \in V$. The local average order of dominating sets containing $v$, denoted $avd_v(G)$, is defined in Lean by simple_graph_local_avg_dominating_order as the arithmetic mean of the cardinalities of the sets in $\mathcal{D}_v(G)$, evaluated in the rational numbers $\mathbb{Q}$: $$avd_v(G) = \frac{\sum_{S \in \mathcal{D}_v(G)} |S|}{|\mathcal{D}_v(G)|}.$$
Definition 3 (Undominated Set $U$): For a fixed vertex $v \in V$, the set of vertices outside the closed neighborhood of $v$ is denoted by $U$. It is defined as $$U = (V \setminus \{v\}) \setminus N(v) = V \setminus N[v].$$ The set $U$ consists of all vertices in $G$ that are not dominated by the singleton $\{v\}$.
Remark on Formalization Conventions: The definition simple_graph_local_avg_dominating_order performs division in the rational field $\mathbb{Q}$. Because the entire vertex set $V$ is always a dominating set containing $v$, the collection $\mathcal{D}_v(G)$ contains the universal set $V$, ensuring that $\mathcal{D}_v(G)$ is nonempty and its cardinality is positive. Consequently, division by zero never occurs. The hypothesis that $G$ has no isolated vertices is given as a universal statement that degrees are strictly positive, rather than an existential statement about neighbors, facilitating arithmetic manipulations. Finally, while $v$ is a fixed distinguished vertex throughout the analysis, the cardinality $n = |V|$ is arbitrary subject to $n \ge 4$.
3. Main result
The main theorem refutes the sharpness of the bound $(5n-1)/6$ for all graphs of order $n \ge 4$ without isolated vertices.
Theorem 1 (simple_graph_local_avg_dominating_order_lt_of_four_le): Let $V$ be a finite type with decidable equality, and let $G$ be a simple graph on $V$ with decidable adjacency. Suppose that the order of $G$ satisfies $n = |V| \ge 4$, and that $G$ has no isolated vertices, so that $\deg(w) > 0$ for all $w \in V$. Then for every vertex $v \in V$, the local average order of dominating sets containing $v$ satisfies $$avd_v(G) < \frac{5n - 1}{6}.$$
In the Lean formalization, the theorem is stated as simple_graph_local_avg_dominating_order_lt_of_four_le, universally quantifying over the vertex type $V$ with finite and decidable instances, the simple graph $G$ with decidable adjacency, the hypothesis that the cardinality of $V$ is at least 4, the condition that every degree is strictly positive, and the vertex $v$, asserting that simple_graph_local_avg_dominating_order evaluated on $G$ and $v$ is strictly less than $(5n - 1)/6$ in the rationals.
This theorem provides a complete negative answer to the sharpness question raised in arXiv:2610.11446 for all $n \ge 4$. In particular, it shows that the extremal behavior observed at $n = 3$, where the path $P_3$ achieves equality $avd_v(P_3) = \frac{7}{3} = \frac{5(3)-1}{6}$, is an isolated phenomenon that cannot occur for any larger graph. Furthermore, the structural argument in the proof provides refined bounds depending on the degree of $v$: when $\deg(v) \ge 2$, it shows that $$avd_v(G) \le \frac{5n + 1 - 2 \deg(v)}{6} \le \frac{5n - 3}{6},$$ and when $\deg(v) = 1$, it proves the strict bound $$avd_v(G) \le \frac{5n - 1}{6} - \frac{1}{6|\mathcal{D}_v(G)|}.$$
theorem simple_graph_local_avg_dominating_order_lt_of_four_le {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (hn : 4 ≤ Fintype.card V) (hiso : ∀ w, 0 < G.degree w) (v : V) : simple_graph_local_avg_dominating_order G v < (5 * (Fintype.card V : ℚ) - 1) / 6
4. Proof
Let $D = \mathcal{D}_v(G)$ denote the family of dominating sets containing $v$.
Proof Idea: To bound the average size of dominating sets in $D$, we express the total size $\sum_{S \in D} |S|$ as $\sum_{x \in V} a(x)$, where $a(x)$ counts dominating sets containing $x$. Each such set either remains dominating upon removing $x$ (so $x$ is removable), or fails to dominate when $x$ is removed (so $x$ is critical). A bijection between removable sets and sets avoiding $x$ yields $a(x) = b(x) + c(x)$, giving $2 \sum_{S \in D} |S| = n |D| + \sum_{x \in V} c(x)$, where $c(x)$ counts sets in which $x$ is critical. For $x \ne v$, any critical set meets the closed neighborhood $N[w]$ in exactly $\{x\}$ for some $w \in U = V \setminus N[v]$. An injection into sets meeting $N[w]$ in at least two vertices proves that at most $2/3$ of all dominating sets meet $N[w]$ in a singleton, strengthened to $3 |S_1(w)| + 2 \le 2|D|$ when $\deg(w) \ge 2$. Summing over $U$ yields $avd_v(G) \le (5n + 1 - 2\deg(v))/6$. When $\deg(v) \ge 2$, this bound is strictly below $(5n-1)/6$. When $\deg(v) = 1$, structural analysis of the leaves in $U$ yields either a vertex of degree at least 2 or a pair of leaves sharing a critical witness set, strictly sharpening the bound to $avd_v(G) \le (5n - 1)/6 - 1/(6|D|) < (5n - 1)/6$.
We now formalize this argument through six lemmas.
Lemma 1 (Superset Closure): The collection $D$ is nonempty and closed under taking supersets: if $S \in D$ and $S \subseteq T \subseteq V$, then $T \in D$.
Proof of Lemma 1: The universal set $V$ contains $v$ and dominates every vertex, so $V \in D$. If $S \in D$ and $S \subseteq T$, then $v \in T$, and any vertex dominated by $S$ remains dominated by $T$.
Lemma 2 (Cardinality of $U$): Let $U = V \setminus N[v]$. Then $|U| = n - 1 - \deg(v)$ and $\deg(v) \le n - 1$.
Proof of Lemma 2: Because $G$ is loopless, $N(v) \subseteq V \setminus \{v\}$. Since $|V \setminus \{v\}| = n - 1$ and $|N(v)| = \deg(v)$, the difference has size $|U| = n - 1 - \deg(v)$, and $\deg(v) \le n - 1$.
Lemma 3 (Criticality Decomposition): For each vertex $x \in V$, let $a(x) = |\{S \in D \mid x \in S\}|$, $b(x) = |\{S \in D \mid x \notin S\}|$, and $c(x) = |\{S \in D \mid x \in S \land S \setminus \{x\} \notin D\}|$. Then:
- $a(x) + b(x) = |D|$;
- $a(x) = b(x) + c(x)$;
- $\sum_{S \in D} |S| = \sum_{x \in V} a(x)$;
- $2 \sum_{x \in V} a(x) = n |D| + \sum_{x \in V} c(x)$.
Proof of Lemma 3: Part 1 is the partition of $D$ by membership of $x$. For Part 2, sets containing $x$ split into removable sets ($S \setminus \{x\} \in D$) and critical sets ($S \setminus \{x\} \notin D$). The map $S \mapsto S \setminus \{x\}$ is a bijection from removable sets to sets avoiding $x$, with inverse $T \mapsto T \cup \{x\}$, which is in $D$ by Lemma 1. Thus the number of removable sets is $b(x)$, giving $a(x) = b(x) + c(x)$. Part 3 exchanges sums of indicator functions. Part 4 adds $a(x) + b(x) = |D|$ and $a(x) - b(x) = c(x)$ to obtain $2 a(x) = |D| + c(x)$, and sums over $x \in V$.
Lemma 4 (Critical Witness Sets): For $w \in V$ and $x \in V$, let $E(w, x) = \{S \in D \mid S \cap N[w] = \{x\}\}$. For any $x \ne v$, every set $S \in D$ in which $x$ is critical satisfies $S \in E(w, x)$ for some $w \in U$. Consequently, $c(x) \le \sum_{w \in U} |E(w, x)|$. Furthermore, if distinct $w_1, w_2 \in U$ satisfy $E(w_1, x) \cap E(w_2, x) \ne \emptyset$, then $c(x) + 1 \le \sum_{w \in U} |E(w, x)|$.
Proof of Lemma 4: If $x \ne v$ and $S \setminus \{x\} \notin D$, then $v \in S \setminus \{x\}$, so some vertex $w$ is not dominated by $S \setminus \{x\}$. Since $v \in S \setminus \{x\}$, $w$ is not dominated by $v$, so $w \in U$. Domination of $w$ by $S$ requires $S \cap N[w]$ to be nonempty, but $(S \setminus \{x\}) \cap N[w] = \emptyset$, so $S \cap N[w] = \{x\}$, placing $S \in E(w, x)$. The union bound yields $c(x) \le \sum_{w \in U} |E(w, x)|$. An overlapping element between $E(w_1, x)$ and $E(w_2, x)$ strictly reduces the cardinality of the union by at least 1.
Lemma 5 (Neighborhood Singleton Bound): For $w \in V$, let $S_1(w) = \{S \in D \mid |S \cap N[w]| = 1\}$ and $S_{\ge 2}(w) = \{S \in D \mid |S \cap N[w]| \ge 2\}$. Then:
- $3 |S_1(w)| \le 2 |D|$;
- If $\deg(w) \ge 2$, then $3 |S_1(w)| + 2 \le 2 |D|$.
Proof of Lemma 5: Since $G$ has no isolated vertices, $w$ has a neighbor $w'$. Define $\phi : S_1(w) \to S_{\ge 2}(w)$ by $\phi(S) = S \cup \{w'\}$ if $w \in S$, and $\phi(S) = S \cup \{w\}$ if $w \notin S$. In both cases, $\phi(S) \in D$ by Lemma 1, and $|\phi(S) \cap N[w]| \ge 2$. Each fiber of $\phi$ has size at most 2, since any preimage must be $M \setminus \{w'\}$ or $M \setminus \{w\}$. Thus $|S_1(w)| \le 2 |S_{\ge 2}(w)| \le 2(|D| - |S_1(w)|)$, which rearranges to $3 |S_1(w)| \le 2 |D|$, proving Part 1. For Part 2, if $\deg(w) \ge 2$, then $|N[w]| \ge 3$, so $V \in S_{\ge 2}(w)$. But $V \notin \mathrm{im}(\phi)$ because removing at most one vertex from $V$ leaves at least $3 - 1 = 2$ vertices in $N[w]$, contradicting $|S \cap N[w]| = 1$. Hence $\mathrm{im}(\phi) \subseteq S_{\ge 2}(w) \setminus \{V\}$, giving $|S_1(w)| \le 2(|S_{\ge 2}(w)| - 1) \le 2(|D| - |S_1(w)| - 1)$, which yields $3 |S_1(w)| + 2 \le 2 |D|$.
Lemma 6 (Criticality Sum): The total criticality sum satisfies $3 \sum_{x \in V} c(x) \le 3 |D| + 2 |U| |D|$. Moreover, if some $w_0 \in U$ has $\deg(w_0) \ge 2$, or if distinct $w_1, w_2 \in U$ share a witness set $S \in E(w_1, x) \cap E(w_2, x)$ for some $x \ne v$, then $3 \sum_{x \in V} c(x) + 1 \le 3 |D| + 2 |U| |D|$.
Proof of Lemma 6: For each $w \in U$, the sets $E(w, x)$ for distinct $x \ne v$ are mutually disjoint subsets of $S_1(w)$, so $\sum_{x \ne v} |E(w, x)| \le |S_1(w)|$. Summing over $x \ne v$ gives $\sum_{x \ne v} c(x) \le \sum_{w \in U} |S_1(w)|$. Multiplying by 3 and applying Lemma 5, Part 1 yields $3 \sum_{x \ne v} c(x) \le 2 |U| |D|$. Adding the trivial bound $3 c(v) \le 3 |D|$ gives the general inequality. When some $w_0 \in U$ has $\deg(w_0) \ge 2$, Lemma 5, Part 2 lowers the sum by at least 2. When two vertices in $U$ share a witness set, Lemma 4 lowers the sum of $c(x)$ by 1, which after multiplying by 3 lowers the total by 3. In both cases, $3 \sum_{x \in V} c(x) + 1 \le 3 |D| + 2 |U| |D|$.
Proof of the Main Theorem: We divide the argument into two cases according to $\deg(v)$.
Case 1: $\deg(v) \ge 2$. By Lemma 2, $|U| = n - 1 - \deg(v)$. Substituting the bound of Lemma 6 into Lemma 3, Part 4 gives: $$2 \sum_{x \in V} a(x) \le \left( n + 1 + \frac{2}{3}(n - 1 - \deg(v)) \right) |D| = \frac{5n + 1 - 2 \deg(v)}{3} |D|.$$ Dividing by $2 |D|$ yields $avd_v(G) \le (5n + 1 - 2 \deg(v))/6$. Since $\deg(v) \ge 2$, this gives $avd_v(G) \le (5n - 3)/6 < (5n - 1)/6$.
Case 2: $\deg(v) = 1$. Since $G$ has no isolated vertices, $v$ has a unique neighbor $y$. By Lemma 2, $|U| = n - 2 \ge 2$ since $n \ge 4$. If some vertex in $U$ has degree at least 2, the strict bound of Lemma 6 holds immediately. Otherwise, every vertex in $U$ has degree 1, so every $w \in U$ is a leaf with a unique neighbor $z \ne v$:
- If some leaf $w \in U$ has its neighbor $z$ in $U$, then $\{w, z\}$ is a connected component isomorphic to $K_2$. The set $S = V \setminus \{z\}$ contains $v$ and dominates $G$, so $S \in D$. We have $S \cap N[w] = \{w\}$ and $S \cap N[z] = \{w\}$, so $S \in E(w, w) \cap E(z, w)$, providing a shared witness set for $w$ between distinct vertices $w, z \in U$.
- If every leaf in $U$ has its neighbor outside $U$, all leaves in $U$ must be adjacent to $y$ (since $v$ only connects to $y$). Because $|U| \ge 2$, choose distinct leaves $w_1, w_2 \in U$. The set $S = V \setminus \{w_1, w_2\}$ contains $v$ and $y$ and dominates $G$, so $S \in D$. Then $S \cap N[w_1] = \{y\}$ and $S \cap N[w_2] = \{y\}$, so $S \in E(w_1, y) \cap E(w_2, y)$, providing a shared witness set for $y \ne v$.
In all subcases of Case 2, Lemma 6 gives $3 \sum_{x \in V} c(x) + 1 \le (2n - 1) |D|$. Substituting into Lemma 3, Part 4 yields $2 \sum a(x) \le \frac{5n - 1}{3} |D| - \frac{1}{3}$, so $avd_v(G) \le \frac{5n - 1}{6} - \frac{1}{6 |D|} < \frac{5n - 1}{6}$. This completes the proof of Theorem 1 (simple_graph_local_avg_dominating_order_lt_of_four_le).
5. Discussion
The theorem proved in this post settles the question of whether the upper bound $(5n-1)/6$ established in Theorem 3.8 of arXiv:2610.11446 can ever be attained for graphs of order $n \ge 4$. It demonstrates that sharpness fails universally: no graph of order $n \ge 4$ without isolated vertices has a vertex $v$ achieving $avd_v(G) = \frac{5n-1}{6}$. The path $P_3$ at an endpoint, which attains $7/3 = (5(3)-1)/6$, is therefore the unique extremal instance among all graphs without isolated vertices.
What the result does not cover is the determination of the exact maximum value of $avd_v(G)$ over all graphs of order $n$ without isolated vertices and all choices of $v \in V(G)$. As noted in the open problem statement, the second part of the question posed in arXiv:2610.11446 asks: what is the exact maximum value of $avd_v(G)$ as a function of $n$?
The material references a conjectured bound $$avd_v(G) \le \frac{2n + 1}{3}.$$ This candidate bound is strictly stronger than $(5n-1)/6$ for all $n \ge 4$: $$\frac{5n - 1}{6} - \frac{2n + 1}{3} = \frac{5n - 1 - 2(2n + 1)}{6} = \frac{n - 3}{6} > 0.$$ At $n = 3$, both bounds coincide: $\frac{2(3) + 1}{3} = \frac{7}{3} = \frac{5(3) - 1}{6}$. For $n = 4$, the conjectured bound yields $\frac{2(4)+1}{3} = 3$, whereas $\frac{5(4)-1}{6} = \frac{19}{6} \approx 3.167$. For $n = 5$, the conjectured bound gives $\frac{11}{3} \approx 3.667$, whereas $\frac{5(5)-1}{6} = 4$. Thus, the bound $(2n+1)/3$ would imply the strict inequality $avd_v(G) < (5n-1)/6$ for all $n \ge 4$. The direct proof formalized in simple_graph_local_avg_dominating_order_lt_of_four_le refutes the sharpness of $(5n-1)/6$ independently of whether $(2n+1)/3$ is attained or provable in full generality, by uncovering the structural obstruction to equality: the simultaneous constraints on the neighborhood intersections of leaves outside $N[v]$ force either a degree-2 vertex or a shared critical witness set.
The prominent next question emerging from arXiv:2610.11446 is whether the conjectured bound $(2n+1)/3$ holds for all $n \ge 4$, and if so, which graphs and vertices achieve equality. Another direction is to characterize the exact maximum value of $avd_v(G)$ as a function of $n$.
Why it is research-level
- refutes OP-135 (Sharpness of the (5n-1)/6 local average dominating set bound for n at least 4)
Lean declarations
- simple_graph_local_avg_dominating_order_lt_of_four_leFor n ≥ 4 the upper bound (5n−1)/6 is never attained: if G has order n ≥ 4 and no isolated vertices, then avd_v(G) < (5n−1)/6 for every…
- simple_graph_dominating_sets_containingD_v(G): the dominating sets of G that contain v, where S dominates G when every vertex is in S or adjacent to a vertex of S.
- simple_graph_local_avg_dominating_orderavd_v(G): the local average order of dominating sets containing v, i.e. the average size of the dominating sets of G that contain v.
Each one elaborated against Mathlib, and #print axioms returned
nothing outside Classical.choice · Quot.sound · propext.
References
- arXiv:2610.11446 — On the local average order of dominating sets
Drafted by gemini-3.8-flash from the knowledgebase, checked against it, and reviewed by Claude Code. Only the Lean is verified; the prose is a reading of it.