The edge-pattern convex-combination conjecture
Let be a -regular edge-rooted pattern of depth and girth . For each edge-rooted pattern, let denote its constraint vector, and let be the specified family of -regular edge-rooted trees of depth . The constraint is weaker than a convex combination of constraints from this family in the sense that there exist and with
and, for every ,
This would explain why the bounds obtained from edge-rooted trees remain valid at girth , and would generalize the cases checked for and .
References
- François Pirot and Jean-Sébastien Sereni, “Fractional chromatic number, maximum degree and girth”, arXiv:1904.05618 (2021).
Progress summary
A reader-submitted calculation claims the conjecture fails in one small case, but no independent verification was found.
Pirot and Sereni's conjecture, recorded in their 2019 work, asks whether every eligible edge-rooted pattern is dominated by a convex combination of the specified tree constraints. The catalogue records no resolution in that source.
Community submission (unverified), November 7, 2026
A submitted argument claims a counterexample at and : an -vertex pattern allegedly has and, for , satisfies , whereas every relevant tree satisfies . If correct, this refutes the conjecture in that case; the submission is unverified.
Current status (as of November 2026): The conjecture has no independently verified resolution; an unverified submission claims it is false for and .
Sources
Solutions 1
A cubic counterexample to edge-pattern convex dominationSee full solution
Result and scope. Pirot-Sereni (arXiv:1904.05618; SIAM J. Discrete Math. 35(4) (2021) 2815-2843) Conjecture 2, also Conjecture 1.5.1 of Pirot's 2019 thesis, is false at d = 3, r = 2. The 8-vertex edge-rooted pattern P (root edge 01; edges 01,02,03,15,17,34,46,56: a 6-cycle with two pendants) is 3-regular, of exact depth 2 and girth 6, with e(P) = (2/5,14/5,4/5). With alpha = (1/1000,7/27,1/3), alpha.e(P) = 67027/67500 < 1, while every acyclic 3-regular depth-2 edge-rooted pattern (all 81 leaf-count forms) has alpha.e(T) >= 3001/3000. So no convex combination of tree constraints is weaker than e(P). The source's optimized bounds (Lemma 10) are unaffected.
Complete proof: A cubic counterexample to edge-pattern convex domination · PDF.
The paper page contains the supplementary proof-source JSON and extract_sources.py. The linked paper supplies the complete argument and states the precise scope of the Lean certificate, ordinary proofs, supporting computations, and source interpretation. Those qualifications are retained here; a supporting computation is not a proof of a broader statement.
This is an AI-assisted research preprint. Internal review is not external journal peer review. Bounded prior-art searches do not establish worldwide priority. See the paper for formalization and trust limits.