§2.1, p. 794 — in a 3-regular n-node graph at most n/2 nodes lie within distance ⌊log n⌋ − 3 of any node
ProvedLeightonRao.BadExample.ball_card_leexpander-graphgraph-distancep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1regular-graph
Let be a 3-regular graph on nodes and write for . For every node , the number of nodes whose graph distance from is at most satisfies
In the gap example this says that most nodes are far from any given node.
Formalization Note The paper writes ; the radius is the integer (for non-integer a graph distance is an integer anyway, so the ball is the same set as for radius rounded down). The hypothesis makes , so the natural-number subtraction is exact. The distance is the extended graph distance (SimpleGraph.edist), which is between nodes in different components, so unreachable nodes are never counted as close.
Preamble
import Mathlib import Definitions.Def_LeightonRao_BadExample_Setting set_option autoImplicit false open scoped BigOperators
Formal statement
namespace LeightonRao.BadExample
/-- §2.1, p. 794: in a 3-regular graph on `n ≥ 8` nodes, at most `n/2` nodes lie within
graph distance `⌊log₂ n⌋ − 3` of any node `v`. -/
theorem ball_card_le {V : Type} [Fintype V] [DecidableEq V]
(G : SimpleGraph V) [DecidableRel G.Adj]
(h3 : G.IsRegularOfDegree 3)
(hn : 8 ≤ Fintype.card V) (v : V) :
2 * ((Finset.univ.filter (fun u =>
G.edist v u ≤ ((Nat.log 2 (Fintype.card V) - 3 : ℕ) : ℕ∞))).card : ℝ)
≤ (Fintype.card V : ℝ) := by sorry
end LeightonRao.BadExample
Source
Leighton and Rao, Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms, J. ACM 46 (1999), p. 794, §2.1, second paragraph after the min-cut display
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.