{"id":"6c8e58f1-3c2a-48ca-aa02-db48acff5171","arxiv_id":"2507.11194","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"A graph is CF-dense when every vertex lies in some minimum connected forcing set; the paper characterizes CF-dense trees and counts connected forcing sets in trees.","lead":"This paper introduces connected forcing density, asking whether every vertex of a graph belongs to some smallest connected zero forcing set. It fully characterizes which trees have this property and also counts the connected forcing sets of a tree.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 16 is false as stated: P3 satisfies the strong-support condition but is not CF-dense, contradicting Proposition 10.","rationale":"Reading the paper in good faith, the central claim is Theorem 16, a complete characterization of CF-dense trees. The reader's conditional verdict focused on reliance on the cited M-set theorem; my check shows the characterization is actually false independent of that citation. P3 is a direct counterexample to condition (b), and the paper's own Proposition 10 asserts S3 is not CF-dense, so this is not an external-theorem failure but an internal contradiction. The enumeration Theorem 18 is restricted to non-path trees and does not inherit this particular error, but the main structural claim of the paper collapses. Because the flaw is localized and easily patched by excluding P3, a revised version may well be correct; nevertheless the submitted version's central theorem is false. I therefore recommend rejecting the current version rather than conditionally accepting it. I disagree with the reader's weakest-assumption identification: the weak spot is not the [10] M-set characterization but the unhandled path case P3 in the proof's jump from non-path M-sets to all trees.","tokens_in":19273,"tokens_out":9778,"duration_ms":110707,"concrete_test":"Verify directly on P3 by brute force: enumerate all subsets of {1,2,3}; the only minimum connected forcing sets are {1} and {3}, so the center is in none, while condition (b) of Theorem 16 holds. This single counterexample refutes the theorem. As a broader check, enumerate all trees on n ≤ 8 vertices and compare CF-dense status with the theorem's condition; P3 is the only tree satisfying the strong-support condition that fails to be CF-dense.","verdict_should_be":"REJECT","load_bearing_attack":"The central tree characterization is internally inconsistent. Consider T = P3 (equivalently S3), with vertices 1-2-3. The only support vertex is the center 2, which is adjacent to the two leaves 1 and 3, so 2 is a strong support vertex; thus condition (b) of Theorem 16 holds. But Zc(P3) = 1, and the minimum connected forcing sets are exactly {1} and {3}: the set {2} is not zero forcing because vertex 2 has two white neighbors, so the center belongs to no minimum connected forcing set. Hence P3 is not CF-dense. The paper itself states this in Proposition 10 ('S3 is not CF-dense'). The proof of Theorem 16 reduces to M-sets via Lemma 14 and Theorem 15, which apply only to non-path trees; the subsequent 'iff' silently includes paths, and P3 slips through because its strong support vertex has degree 2. The characterization therefore fails as written. The fix is to exclude P3 explicitly, e.g., add 'and T is not P3' to condition (b); with that patch the theorem likely becomes correct, but as stated the headline result is false.","agreement_with_reader":"disagree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper introduces CF-dense graphs, in which every vertex belongs to some minimum connected forcing set, and studies their relation to the previously studied ZF-dense and TF-dense graphs. It establishes CF-density for several families (cycles, complete graphs, wheels, hypercubes, complete multipartite graphs, diamond necklaces), gives a characterization of CF-dense trees, develops a formula for the number of connected forcing sets of each size in a tree, and analyzes preservation of CF-density and ZTCF-density under Cartesian products, joins, and coronas. The paper is written in a clear, verifiable style, with explicit worked examples such as the enumeration in Example 2.","tokens_in":19470,"tokens_out":20930,"duration_ms":246660,"significance":"The notion of CF-density is a natural connected analogue of the existing ZF-density and TF-density concepts, and the paper provides a useful set of sufficient conditions and constructions. If corrected, the tree characterization and the tree enumeration formula would be the main contributions, complementing the earlier work on zero and total forcing density. The paper contains no fitted parameters and no circular reasoning; its arguments are mostly direct, and several proofs, such as those for the wheel, hypercube, and diamond necklace families, are checkable and correct.","major_comments":[{"comment":"The statement is false as written. The tree P3 satisfies condition (b): its only support vertex is the center, which is adjacent to two leaves and is therefore a strong support vertex. Yet P3 is not CF-dense: its minimum connected forcing sets are exactly the two single-vertex sets consisting of one endpoint or the other, and the central vertex belongs to neither. This contradicts Proposition 10, which explicitly notes that S3 (=P3) is not CF-dense. The proof reduces the problem to M-sets via Lemma 14 and Theorem 15, which are stated for trees different from paths, so path cases are not handled. The theorem can be repaired by excluding P3, for example by adding 'and T is not P3' to condition (b), but as stated the characterization is false.","section":"Section 5, Theorem 16"},{"comment":"The displayed enumeration formula is false. For the star S4, the formula gives zc(S4;3)=0: with |I1|=3, |M|=3, and d=3, the first factor is s(2;1,1,1), which is empty because three positive integers each at most 1 cannot sum to 2. In fact, the three sets consisting of the center and any two leaves are exactly the minimum connected forcing sets, so zc(S4;3)=3. The reason for the failure is that the factor s(|Ij|-1+S'_{i,j}; [|p_l| : l∈Ij]) counts only distributions where every pendant path receives a positive number of vertices, whereas the definition of M-sets allows exactly one pendant path to be omitted. Proposition 17 shows the correct local count includes a sum over the choice of the omitted path. The formula and its proof need to be corrected.","section":"Section 5, Theorem 18"},{"comment":"The proof of Lemma 35 asserts without proof that Z(H'_i)=Z(H)+1 for H'_i=K1∨H. This fact does follow from Lemma 27 applied to the join with K1, but the justification should be stated. In addition, the proofs of Theorem 37 (third bullet) and Theorem 38 verify the arbitrary vertex v only when v lies in a copy of H; the case v∈V(G) is omitted. It is immediate because the constructed minimum sets contain all of V(G), but as written the arbitrary-vertex argument is incomplete.","section":"Section 6.3, Lemma 35 and Theorems 37-38"}],"minor_comments":[{"comment":"The notation R1_3 is used in the statement but not defined in Section 2. Please define it explicitly and distinguish it from the R1 set appearing in Definition 3.","section":"Section 5, Theorem 18"},{"comment":"The sentence 'Note also that S3 is not CF-dense, since then the central vertex would not be contained in any minimum connected forcing set' is grammatically misleading; it should say 'since the central vertex is not contained in any minimum connected forcing set.'","section":"Section 4, Proposition 10"},{"comment":"In the final line of the proof of Lemma 29(b), the inequality Zc(G∨H) ≥ Z(G∨H) is used together with Lemma 27; please make explicit that the equality Z(G∨H)=min{Z(G)+|V(H)|, Z(H)+|V(G)|} comes from Lemma 27 so that the reader is not left to infer it.","section":"Section 6.2, Lemma 29"}],"recommendation":"major_revision","confidential_remarks":"The two main tree results are false as stated, but both counterexamples are small and the repairs appear to be local: exclude P3 in Theorem 16 and add the omitted-path sum in Theorem 18. I therefore recommend major revision rather than rejection. The authors should also re-verify Theorem 18 on additional small trees and double-check the dependence on the M-set characterization from [10]."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Two things to know. First, the paper introduces CF-density, a sensible new notion, and gives a very usable tree characterization with a linear-time check. That is genuinely new and will be useful to the zero forcing crowd. Second, the characterization is false as stated. P3 satisfies condition (b)—its only support vertex has two leaf neighbors—but P3 is not CF-dense, as the paper itself notes in Proposition 10 (S3). The proof of Theorem 16 applies the M-set characterization from [10], which only holds for non-path trees; paths are handled by case (a), and P3 slips through. The fix is one line: require the tree to not be a path, or exclude P3 explicitly. With that patch the theorem is almost certainly correct.\n\nThe other real contribution is Theorem 18, the closed-form count of connected forcing sets in trees. It is formula-heavy but appears to work; the worked example in Figure 3/4 checks out. The diamond necklace computation in Theorem 13 is also a nice catch. The product/join/corona sections are more routine, mostly sufficient conditions, but they are correct in spirit.\n\nThe soft spots beyond P3 are in the corona section. Lemma 35 asserts without proof that Z(H∨K1)=Z(H)+1 for isolate-free H. That assertion is actually false: take H=2K2 or two disjoint P3s, both give Z(H∨K1)=Z(H). The lemma's final formula may still be true, but the proof as written does not establish it. Theorems 37 and 38 also forget to say what happens when the vertex to cover lies in V(G); that case is easy (V(G) is in the constructed minimum sets), so it's a minor gap, not a fatal one. Theorem 3's proof is terse at one point but can be filled.\n\nNet: the central tree result is wrong as stated but trivially fixable; the corona proof needs real repair. The paper is not desk-reject material, but it needs a serious revision before it should be accepted. A good referee will catch the P3 counterexample in minutes. I'd send it to review and tell the authors to patch Theorem 16 and Lemma 35, then re-check Theorem 18 and the corona lemmas.","headline":"New CF-density notion and tree characterization are useful, but the headline theorem is false as stated (P3 is a counterexample) and a key corona lemma rests on a false assertion.","tokens_in":19959,"tokens_out":22798,"would_cite":false,"duration_ms":246002,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05C69","05C05","05C76","05A15"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper proves that CF-dense trees are exactly the one- and two-vertex paths and the trees in which every support vertex is a strong support vertex, and it provides a closed-form enumeration of all connected forcing sets in trees.","keywords":["connected forcing","zero forcing","CF-dense graphs","ZTCF-dense graphs","trees","graph operations","enumeration","forcing density"],"falsifier":"Run a brute-force search over all trees with at most ten vertices: for each tree, list every minimum connected forcing set by testing all subsets under the zero-forcing color-change rule and connectedness. If any tree outside {P1,P2} has a support vertex with exactly one leaf neighbor and yet every vertex appears in some minimum connected forcing set, Theorem 16 is false; likewise, if any tree whose support vertices are all strong has a vertex excluded from every minimum connected forcing set, the theorem fails.","tokens_in":19064,"feed_emoji":"🌳","tokens_out":10062,"duration_ms":113324,"temperature":0.7,"pith_summary":"Connected forcing sets are zero forcing sets whose induced subgraph is connected, and a graph is CF-dense when every vertex belongs to at least one minimum connected forcing set. The paper introduces CF-dense graphs as a companion to the existing notions of ZF-dense and TF-dense graphs, then asks which graphs, especially trees, have this property. Its central result is a complete characterization: a tree is CF-dense exactly if it is a path on one or two vertices, or every support vertex of the tree is a strong support vertex — in plain terms, every leaf has a sibling leaf. A second main result is a closed-form formula for the number of connected forcing sets of each size in any tree. The paper also proves that several familiar families (cycles, complete graphs, wheels, hypercubes, complete multipartite graphs, diamond necklaces) are dense in the strongest combined sense, and gives conditions under which Cartesian products, joins, and coronas preserve density.","feed_headline":"Every leaf needs a sibling for a CF-dense tree","feed_subtitle":"Connected forcing density in trees holds exactly when no leaf is an only child.","key_machinery":"The load-bearing object is the M-set characterization of minimum connected forcing sets in non-path trees, taken from [10]: a set is a minimum connected forcing set exactly when it contains all vertices of R2 ∪ R3 (the vertices whose removal splits the tree in a way that makes them unavoidable) and, for every branching vertex, all but one of the bases of its pendant paths. This reduces the density question to a local choice problem: which vertices can be chosen as the excluded or included pendant-path bases. The counting formula is carried by the functions s and s′ from Definition 5, which count k-tuples of positive (respectively nonnegative) integers bounded by b1,...,bk and summing to a; these encode how many non-mandatory vertices can be placed on each pendant path group. The product structure of Theorem 18 arises because the choices at different branching vertices are independent once the total extra vertices per group are fixed.","core_discovery":"The central claim is Theorem 16: a tree T is CF-dense if and only if T is P1, T is P2, or every support vertex of T has at least two leaf neighbors. In other words, apart from the two smallest paths, a tree is CF-dense exactly when no leaf is an only child of its parent. The proof works through the M-set characterization of minimum connected forcing sets in non-path trees: such a set must contain all mandatory vertices and all but one of the bases of the pendant paths attached to each branching vertex, so a vertex can be avoided by every minimum connected forcing set only if it lies on a pendant path that is not the chosen 'extra' path. The paper's companion result, Theorem 18, counts the connected forcing sets of every size in a tree by distributing the non-mandatory vertices among the groups of pendant paths attached to the branching vertices, using two integer-composition counting functions. Together these results turn tree CF-density into a linear-time local check and make the full list of minimum connected forcing sets of a tree exactly enumerable from its pendant path lengths.","pith_inferences":["An extension the paper leaves implicit: because the tree criterion is purely local, an analogous characterization for unicyclic or chordal graphs may hold with the same pendant-path logic, and this is directly testable by brute force on small members of those families.","The enumeration formula's composition-counting structure suggests the count zc(T;d) could be repackaged as the coefficient of a generating function in one variable, which would give a faster way to evaluate all sizes simultaneously than the paper's per-size sum.","The product and join preservation results are sufficient conditions; a natural question not answered here is whether equalities like Zc(G□H)=Zc(G)|V(H)| are also necessary for density to be inherited, and small Cartesian products can be checked exhaustively to test necessity."],"forward_implications":["CF-density of a tree can be checked in linear time by scanning for support vertices with exactly one leaf neighbor.","Theorem 18 gives an exact count of connected forcing sets of every size in a tree, so in particular the number of minimum connected forcing sets is computable directly from the pendant path lengths.","The graphs proved ZTCF-dense include cycles, complete graphs, wheels, hypercubes, complete multipartite graphs that are not stars, and diamond necklaces; diamond necklaces also show that Z(G)