The only Class 0 Flower snark is the smallest

Andr\'e Luis Alves Martins; Celina Miraglia Herrera de Figueiredo; Franklin de Lima Marquezino; Guilherme Adamatti Bridi

REVIEW 5 major objections 4 minor 17 references

The only Class 0 Flower snark is the smallest

T0 review · 5 major / 4 minor · reviewed 2026-08-07 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read The smallest Flower snark $J_3$ is Class 0: its pebbling number is 12, and earlier bounds make it the only one in the family.

desk verdict A genuine new result on a 12-vertex graph, with a plausible but under-specified hand proof; the gap between asserted bounds and derived bounds is real, but the paper deserves a referee, not a desk reject. read the letter →

arxiv 2505.22941 v2 pith:HEIGTTVE submitted 2025-05-28 math.CO cs.DM

Guilherme Adamatti Bridi , André Luis Alves Martins , Franklin de Lima Marquezino , Celina Miraglia Herrera de Figueiredo This is my paper

classification math.COcs.DM MSC 05C57

keywords graphpebblingnumberClass0Flowersnarksdiameter-3graphsbound-basedcaseanalysis

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Graph pebbling asks how many pebbles guarantee that every starting arrangement can move a pebble to any chosen target vertex, where a move takes two pebbles from one vertex and puts one on a neighbor. The paper establishes that the smallest Flower snark $J_3$, a 12-vertex graph of diameter 3, is Class 0: its pebbling number is exactly $\pi(J_3)=n(J_3)=12$, so every configuration of 12 pebbles can reach every target. Because an earlier study had already ruled out every larger Flower snark, this single computation completes the family's classification: $J_3$ is the only Class 0 Flower snark. To get there, the authors use a bounding-and-case-analysis method that does not depend on the dual weight-function approach, which had been shown incapable of deciding this case.

What carries the argument

The carrying mechanism is a distance-layer bounding scheme. Around a chosen target $r$, the vertices are grouped into the sets $A,B,E,F$ lying in the first, second, and third neighborhoods of $r$, and the proof derives upper bounds on how many pebbles an $r$-unsolvable configuration can hold in each set and in useful unions. The key inequalities are the trivial per-vertex bound $C(v)\le 2^{d(v,r)}-1$, the set bounds $C(X)\le 4$ and $C(A\cup B)\le 6$, and the derived transport inequalities $C(F)+2C(X)\le 10$ and $C(F)+2C(A\cup B)\le 14$, which express that pebbles in the outer set $F$ can be moved inward to $X$ or to $A\cup B$. Case divisions by $C(A\cup B)$ and $C(E)$ force contradiction with 12 total pebbles; for the hardest target, the same machinery is reapplied to reduced graphs obtained by deleting a neighbor carrying exactly one pebble.

What would settle it

Enumerate all $\binom{23}{11}=1,352,078$ multisets of 12 pebbles on the 12 vertices of $J_3$ and, for each target $r$, perform an exhaustive search over pebbling moves; a configuration from which some target cannot be reached disproves Theorem 2.1. A more local falsifier would be an $r$-unsolvable configuration with $C(X)\ge 5$ for some $X\in\{A,B,E\}$ or $C(A\cup B)\ge 7$, exactly what the proof's bounds forbid.

Watch

Extended reading notes

Core claim

The paper's central claim, stated as Theorem 2.1, is that the smallest Flower snark $J_3$ is Class 0: the pebbling number is $\pi(J_3)=n(J_3)=12$. The proof analyzes the three non-symmetric targets $z_0$, $x_0$, and $v_0$. For each target it assumes, toward a contradiction, that some configuration with 12 pebbles is unsolvable, partitions the graph into sets $A,B,E,F$ according to distance from the target, and uses bounds on the number of pebbles each set can carry in an unsolvable configuration---$C(X)\le 4$ for $X\in\{A,B,E\}$, $C(A\cup B)\le 6$, and the derived inequalities $C(F)+2C(X)\le 10$ and $C(F)+2C(A\cup B)\le 14$---to show that every way of placing 12 pebbles exceeds one of these bounds. The target $v_0$, which has four vertices at distance 3, requires additional reductions and is the hardest case. Since earlier work had already excluded all larger Flower snarks, proving $J_3$ Class 0 completes the classification: it is the only Class 0 Flower snark.

Load-bearing premise

The proof rests on the asserted bounds that an $r$-unsolvable configuration can hold at most four pebbles in any of the inner sets $A,B,E$ and at most six in $A\cup B$, together with the two transport inequalities derived from them; if any of those bounds fails in an unsolvable configuration, the contradiction for that case collapses.

Editorial extensions

If this is right

The pebbling number of $J_3$ is exactly 12, so any configuration of 12 pebbles can reach any chosen target vertex.
Together with earlier bounds excluding every larger Flower snark, the Flower family contains exactly one Class 0 graph, $J_3$.
The proof supplies a non-dual route to pebbling upper bounds, one that can tighten upper-bound windows for graphs whose pebbling number is not yet known.
For the other cubic 12-vertex girth-3 diameter-3 graphs considered in the final remarks, unsolvable 12-pebble configurations are exhibited, so at most one of these parameter-mates remains a possible Class 0 graph.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

The paper's observation that target $v_0$, with four distance-3 vertices, is markedly harder than targets with two suggests the method's cost scales with the width of the outermost neighborhood; testing it on diameter-3 graphs with larger third layers would show where the bounding scheme breaks.
Because the search space of 12 pebbles on 12 vertices is finite, an exhaustive enumeration could certify that the three exhibited non-Class 0 graphs have pebbling number 13, closing the one-pebble gap the paper leaves open.
If the scarcity seen in the Flower family extends to other snark families, then Class 0 snarks may be very rare; the immediate test is the one remaining 12-vertex cubic graph with the same parameters as $J_3$.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

Your stress-test note lands, mostly. The paper is a serious attempt at a real open case: it proves pi(J3)=12, and with Adauto et al.'s earlier bounds that makes J3 the only Class 0 Flower snark. That is a genuine new result, not a repackaging. The proof strategy is honestly described as a collection of bounds plus case splits rather than a general framework, and the authors do useful sanity checks: the Petersen graph is redone in their language, and they ship code verifying that three other 12-vertex cubic graphs with the same parameters are not Class 0. The final remarks about the method's limitations are refreshingly explicit.

The soft spot is exactly where you put it. The z0 proof's load-bearing structural bounds—C(X)≤4, C(A∪B)≤6, and Eqs. (1)-(2)—are asserted more than derived. "Observe that" is doing heavy work for a claim that is not obvious from the figure alone. The x0 target and the reduced v0 graphs are then partly delegated to "similar" or "directly transferable" arguments. The supplied code checks unsolvability for three non-Class-0 graphs; it does not check the actual Class 0 claim for J3. If any of those inequalities fails, the contradiction collapses. I did not find a counterexample by hand, and the bounds may be true, but a referee cannot certify the theorem from the text as written without reconstructing several arguments.

I want to be fair: this is not circular or hand-wavy in the bad sense. The case analysis is structured, the transferred arguments are plausibly really similar, and the authors explicitly flag the limits of their method. The issue is reproducibility, not integrity.

Who is this for? Graph pebbling people and snark people. A serious referee can extract the proof and check the gaps, so I would not desk-reject. I would send it out with a clear request: either expand the omitted subcases or add a verifier that exhaustively checks J3. If the authors can do that, the result is solid.

Referee Report

5 major / 4 minor

Summary. The paper proves Theorem 2.1: the smallest Flower snark J3 (also known as Tietze's graph) has pebbling number pi(J3) = n(J3) = 12 and is therefore Class 0. Since the earlier bounds of Adauto et al. [8] already showed that no other Flower snark can be Class 0, this establishes that J3 is the only Class 0 Flower snark. The proof is a hand-written case analysis over the three non-symmetric targets z0, x0, and v0, using bounds on the number of pebbles in carefully chosen subsets A, B, E, F and derived inequalities (1), (2), and (3), together with two graph reductions for the v0 case. The paper also reports unsolvable configurations with 12 pebbles for three other cubic graphs with the same parameters as J3, and provides code for verifying those unsolvability claims.

Significance. If the proof is correct, the paper settles the open question posed in Adauto et al. [8] and identifies the only Class 0 Flower snark, a natural and interesting result in graph pebbling. The proposed bound-based case-analysis method for 3-diameter graphs is a useful addition to the toolbox, and the paper honestly discusses its limitations beyond diameter 3. A concrete strength is the reproducible code for verifying unsolvability of the three non-Class-0 graphs in Figure 5. However, the central Class 0 claim for J3 is not machine-checked in the provided repository and rests on several structural bounds that are asserted rather than derived; the significance of the paper will be fully realized only after those gaps are closed.

major comments (5)

[Section 2, target z0] The assertions that an r-unsolvable configuration must satisfy C(X) <= 4 for X in {A,B,E} and C(A union B) <= 6 are stated without proof. These are load-bearing: they are used to derive Eqs. (1) and (2), and every subcase of the z0 analysis depends on those inequalities. Please provide a lemma that proves each bound by explicitly showing, for every configuration exceeding the claimed bound, a sequence of pebbling moves that reaches the target z0.
[Section 2, Eqs. (1) and (2)] Eqs. (1) and (2) are asserted after the sentence 'By combining the former property with C(X)<=4 and C(A union B)<=6', but the combination is not shown. In particular, the text does not make explicit how the transport condition 'if C(F) >= 2k+1, we can transport k pebbles from F to X' and the clause 'if C(X)=4, we can move a pebble from X to F' interact to yield the exact constants 10 and 14. Please write out the derivation, for example as a short table of cases over possible values of C(X) and C(A union B), so that the inequalities can be independently checked.
[Section 2, target x0] The x0 target analysis is incomplete. The cases C(A union B) = 6, C(A union B) = 5, and C(A union B) <= 1 are dismissed as 'solved analogously' to the corresponding z0 cases, and the remaining cases end with 'any omitted subcases can likewise be resolved in the same way as their counterparts.' Since the text itself notes that the adjacency structure between F and A/B differs between z0 and x0 and that Eq. (1) holds only for X = E, a simple analogy is not automatic. Please provide the full case analysis for x0, or give a precise subcase-by-subcase translation from the z0 proof that accounts for the structural differences.
[Section 2, target v0, Figure 3 reductions] The reductions used for target v0 are not proven. The statement that 'if we add one more pebble to v1, then the configuration is r-solvable. Therefore, the neighbors of v1 (except v0) act as neighbors of v0' is a heuristic rather than a formal reduction argument. The subsequent claim that 'all the arguments used on target z0 are directly transferable' to the reduced graph of Figure 3(a) is asserted despite the structural difference that E has only one vertex in N2(r) and the configuration has only 11 pebbles. Similarly, for the reduced graph of Figure 3(b), the bounds C(A union B) <= 6 and C(E union F) <= 6 are stated without derivation. Please provide formal reduction lemmas, or explicitly verify the bounds and the transfer of arguments for each reduced graph.
[Section 2, target v0, Eq. (3)] In the v0 analysis after the reductions, the bounds C(X) <= 8 for X in {A,B} and the derived inequality C(X) + 2 C(E) <= 11 (Eq. (3)) are stated without proof. The threshold condition 'if C(X) >= 2k+2, where k in N, we can send k pebbles through X' also needs justification. These bounds are used to force the values of C(E), C(A), and C(B) in all remaining v0 subcases. Please provide derivations for C(X) <= 8, for the transport threshold 2k+2, and for Eq. (3), so that the contradiction arguments in the v0 case can be verified.

minor comments (4)

[Section 2, target v0] In the definition of the set B for the v0 analysis, the text reads 'B={z −1 x−1,y−1}'; it should be 'B={z−1, x−1, y−1}' with a comma after z−1.
[Section 2, Figure 4] The sentence 'Let A={a0,a−1,a1}, B={b0,b−1,b1}, E={e0,e−1,e1}, and X,Y,Z∈{A,B,E},Y,Z.' contains a garbled trailing 'Y,Z.' Please correct this typographical error.
[Introduction, notation] The notation N(r) is used for the first neighborhood before the definition of N^k(v) is given; please reconcile the notation so that N^1(r) and N(r) are used consistently.
[Final remarks] The observation that 'the targets z0 and x0 can be fully solved using only Eq. (1) (X=E) and Eq. (2) if x >= 13' is interesting but is not proven in the text; either provide a short proof or label it explicitly as a conjecture for future work.

Circularity Check

0 steps flagged · score 0.0 of 10

No material circularity: the Class 0 proof is a direct case analysis, and uniqueness rests on independent prior published bounds that left the J3 question open.

full rationale

The paper's central derivation is a case-by-case contradiction analysis for three target vertices of J3 with 12 pebbles. No parameter is fitted to data, no quantity is predicted from inputs, and no known result is merely renamed. The unproven structural inequalities C(X) <= 4, C(A union B) <= 6, and Eqs. (1)-(2) are asserted constraints used inside the case analysis; they are not shown to be equivalent to the theorem being proved, so any shortcoming there is a proof-completeness or correctness risk, not circularity. The claim that larger Flower snarks are not Class 0 is explicitly delegated to Adauto et al. [8], a separate published paper that bounds the Flower snark family and expressly left J3 open; even though the author lists overlap, the present theorem does not feed back into [8], so the delegation is not circular. The reduction of targets to z0, x0, and v0 cites the authors' own [10], but it is a symmetry/exposition step and not the load-bearing engine of the argument. Overall, the derivation chain is self-contained enough that no step reduces to its own inputs by construction.

Assumptions & free parameters 0 free parameters · 6 assumptions · 0 invented entities

All pebbling bounds used in the proof are either standard distance bounds or structural inequalities asserted in the case analysis. The key structural inequalities are not derived in the manuscript, so they are counted as assumptions in the ledger. The uniqueness result also depends on the classification bounds from [8].

assumptions (6)

standard math A vertex at distance d from the target cannot hold 2^d or more pebbles in an unsolvable configuration, so C(v) <= 2^d - 1.
Used in the proof as the 'key trivial bound' before Theorem 2.1. This is a standard graph pebbling fact.
ad hoc to paper For target z0, an r-unsolvable configuration must satisfy C(X) <= 4 for X in {A,B,E} and C(A union B) <= 6.
Stated as an observation after Figure 2(a) but not derived in the manuscript. The case analysis for z0, x0, and the reduced graphs in Figure 3 relies on these bounds.
ad hoc to paper The derived inequalities Eq. (1), C(F) + 2C(X) <= 10, and Eq. (2), C(F) + 2C(A union B) <= 14, are valid and are used to force pebble counts in subcases.
These are presented as consequences of the previous bounds, but the derivation is compressed and the subsequent proof assumes them without further justification.
ad hoc to paper The reduction of the v0 target case to the graphs in Figure 3, with C(E) <= 3 replacing C(E) <= 4, preserves the unsolvability analysis.
The text says 'all the arguments used on target z0 are directly transferable', but no detailed proof of the transfer is given.
domain assumption The earlier proofs in Adauto et al. [8] correctly restrict possible Class 0 Flower snarks to J_3.
The uniqueness conclusion 'the only Class 0 Flower snark' depends on these external bounds. The authors cite the result appropriately.
domain assumption The graph J_3 has enough symmetry that only targets z0, x0, and v0 need to be analyzed.
The proof states 'without loss of generality' and cites [10] for the three non-symmetric targets; the automorphism argument is not repeated in this paper.

how reviews work

0 comments

Cite this review

Pith. "Pith review of The only Class 0 Flower snark is the smallest." pith.science (2026). https://pith.science/paper/HEIGTTVE

@misc{pith2026250522941,
  author       = {Pith},
  title        = {Pith review of: The only Class 0 Flower snark is the smallest},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/HEIGTTVE}},
  note         = {Machine review of arXiv:2505.22941}
}

abstract

Graph pebbling is a game played on graphs with pebbles on their vertices. A pebbling move removes two pebbles from one vertex and places one pebble on an adjacent vertex. The pebbling number is the smallest $t$ so that from any initial configuration of $t$ pebbles it is possible, after a sequence of pebbling moves, to place a pebble on any given target vertex. Graphs whose pebbling number is equal to the number of vertices are called Class~$0$ and provide a challenging set of graphs that resist being characterized. In this note, we answer a question recently proposed by the pioneering study on the pebbling number of snark graphs: we prove that the smallest Flower snark $J_3$ is Class~$0$, establishing that $J_3$ is in fact the only Class~$0$ Flower snark.

Figures

Figures reproduced from arXiv: 2505.22941 by the authors.

**Figure 1.** The smallest Flower snark J3. Graph pebbling. A configuration C on a graph G is a function that assigns to each vertex v ∈ V(G) a number C(v) ∈ N representing the number of pebbles at that vertex. We define C(X) for a set X ⊆ V(G) as the sum of pebbles on the vertices of X, i.e., C(X) = P v∈X C(v). A pebbling move removes two pebbles from a vertex v and places one pebble on a neighbor u ∈ N(v). If there is a combina… view at source ↗

**Figure 2.** Neighborhood representations of the graph [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗

**Figure 3.** Neighborhood representation of the reduced version graphs used to solve the cases (a) [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗

Figures from the paper (2 more)

**Figure 4.** Figure 4: Proof that Petersen graph P is Class 0 by our bound-based approach. Subfigure 4(a) shows the standard representation of the Petersen graph, while Subfigure 4(b) shows its neighborhood representation. Petersen is a vertex-transitive graph, reducing the analysis to one t…

**Figure 5.** Figure 5: Unsolvable configurations with 12 pebbles for three cubic graphs with 12 vertices, girth 3, and diameter 3: (a) graph #1395 (truncated [PITH_FULL_IMAGE:figures/full_fig_p007_5.png]

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

17 extracted references · 16 canonical work pages

[8]

Adauto, C

M. Adauto, C. de Figueiredo, G. Hurlbert, D. Sasaki, On the pebbling numbers of Flower, Blanuša and Watkins snarks, Discrete Applied Mathematics 361 (2025) 336–346

work page 2025
[1]

Hurlbert, A survey of graph pebbling, Congressus Numerantium 139 (1999) 41–64

G. Hurlbert, A survey of graph pebbling, Congressus Numerantium 139 (1999) 41–64

work page 1999
[2]

Czygrinow, G

A. Czygrinow, G. Hurlbert, H. A. Kierstead, W. T. Trotter, A note on graph pebbling, Graphs and Combinatorics 18 (2002) 219–225

work page 2002
[3]

Pachter, H

L. Pachter, H. Snevily, B. V oxman, On pebbling graphs, Congressus Numerantium 107 (1995) 65–80

work page 1995
[4]

T. A. Clarke, R. A. Hochberg, G. H. Hurlbert, Pebbling in diameter two graphs and products of paths, Journal of Graph Theory 25 (2) (1997) 119–128

work page 1997
[5]

Alcón, M

L. Alcón, M. Gutierrez, G. Hurlbert, Pebbling in split graphs, SIAM Journal on Discrete Mathematics 28 (3) (2014) 1449–1466

work page 2014
[6]

Adauto, V

M. Adauto, V . Bardenova, M. da Cruz, C. de Figueiredo, G. Hurlbert, D. Sasaki, Pebbling in Kneser graphs, in: Latin American Symposium on Theoretical Informatics, Lecture Notes in Computer Science, V ol. 14579, Springer, 2024, pp. 46–60

work page 2024
[7]

Cavicchioli, M

A. Cavicchioli, M. Meschiari, B. Ruini, F. Spaggiari, A survey on snarks and new results: Products, reducibility and a computer search, Journal of Graph Theory 28 (2) (1998) 57–86

work page 1998

Show all 17 references

[9]

Hurlbert, The weight function lemma for graph pebbling, Journal of Combinatorial Optimization 34 (2) (2017) 343–361

G. Hurlbert, The weight function lemma for graph pebbling, Journal of Combinatorial Optimization 34 (2) (2017) 343–361

2017
[10]

Bridi, F

G. Bridi, F. Marquezino, C. de Figueiredo, A weight function lemma heuristic for graph pebbling, arXiv preprint arXiv:2505.16050 (2025)

2025 arXiv
[11]

P. G. Tait, Remarks on the colouring of maps, Proceedings of the Royal Society of Edinburgh 10 (1880) 729
[12]

Campos, S

C. Campos, S. Dantas, C. de Mello, The total-chromatic number of some families of snarks, Discrete Mathemat- ics 311 (12) (2011) 984–988

2011
[13]

Clark, R

L. Clark, R. Entringer, Smallest maximally nonhamiltonian graphs, Periodica Mathematica Hungarica 14 (1) (1983) 57–68

1983
[14]

N. G. Watson, The complexity of pebbling and cover pebbling, arXiv preprint math/0503511 (2005)

2005 arXiv
[15]

Milans, B

K. Milans, B. Clark, The complexity of graph pebbling, SIAM Journal on Discrete Mathematics 20 (3) (2006) 769–798

2006
[16]

Bukh, Maximum pebbling number of graphs of diameter three, Journal of Graph Theory 52 (2006) 353–357

B. Bukh, Maximum pebbling number of graphs of diameter three, Journal of Graph Theory 52 (2006) 353–357

2006
[17]

Brinkmann, K

G. Brinkmann, K. Coolsaet, J. Goedgebeur, H. Mélot, House of graphs: a database of interesting graphs, Discrete Applied Mathematics 161 (1-2) (2013) 311–314. 8

2013

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.

[1] [8]

Adauto, C

M. Adauto, C. de Figueiredo, G. Hurlbert, D. Sasaki, On the pebbling numbers of Flower, Blanuša and Watkins snarks, Discrete Applied Mathematics 361 (2025) 336–346

work page 2025

[2] [1]

Hurlbert, A survey of graph pebbling, Congressus Numerantium 139 (1999) 41–64

G. Hurlbert, A survey of graph pebbling, Congressus Numerantium 139 (1999) 41–64

work page 1999

[3] [2]

Czygrinow, G

A. Czygrinow, G. Hurlbert, H. A. Kierstead, W. T. Trotter, A note on graph pebbling, Graphs and Combinatorics 18 (2002) 219–225

work page 2002

[4] [3]

Pachter, H

L. Pachter, H. Snevily, B. V oxman, On pebbling graphs, Congressus Numerantium 107 (1995) 65–80

work page 1995

[5] [4]

T. A. Clarke, R. A. Hochberg, G. H. Hurlbert, Pebbling in diameter two graphs and products of paths, Journal of Graph Theory 25 (2) (1997) 119–128

work page 1997

[6] [5]

Alcón, M

L. Alcón, M. Gutierrez, G. Hurlbert, Pebbling in split graphs, SIAM Journal on Discrete Mathematics 28 (3) (2014) 1449–1466

work page 2014

[7] [6]

Adauto, V

M. Adauto, V . Bardenova, M. da Cruz, C. de Figueiredo, G. Hurlbert, D. Sasaki, Pebbling in Kneser graphs, in: Latin American Symposium on Theoretical Informatics, Lecture Notes in Computer Science, V ol. 14579, Springer, 2024, pp. 46–60

work page 2024

[8] [7]

Cavicchioli, M

A. Cavicchioli, M. Meschiari, B. Ruini, F. Spaggiari, A survey on snarks and new results: Products, reducibility and a computer search, Journal of Graph Theory 28 (2) (1998) 57–86

work page 1998