{"schema_version":"task-form-representation.payload.v1","representation":{"schema_version":"task-form-representation.v2","task_form_ref":"task-form.logic.unique-perfect-matching-edge-extremum-proof.v1","public_slug":"unique-perfect-matching-edge-extremum-proof","owning_skill_refs":["logic.olympiad.invariants-casework-pigeonhole","logic.proof-counterexample.artifacts","logic.combinatorics.counting-list"],"primary_family_ref":"module-family.logic.constraint-deduction-combinatorics.v1","pattern_cluster_ref":"pattern-cluster.logic.olympiad-method-adapters.v1","task_pattern_ref":"task-pattern.logic.unique-perfect-matching-edge-extremum.v1","public_title":"Unique-perfect-matching edge extremum proof","teacher_summary":"Unique-perfect-matching edge extremum proof asks the player to for a balanced finite bipartite graph constrained to have a unique perfect matching, submit the maximum edge count, an upper-bound certificate, and an attaining construction.","teacher_purpose_md":"For a balanced finite bipartite graph constrained to have a unique perfect matching, submit the maximum edge count, an upper-bound certificate, and an attaining construction.","player_action_public":"For a balanced finite bipartite graph constrained to have a unique perfect matching, submit the maximum edge count, an upper-bound certificate, and an attaining construction.","answer_affordance_public":"Complete the unique-perfect-matching edge extremum proof action.","visual_primitive_public_refs":["attaining_construction","balanced_bipartite_vertex_sets","compressed_directed_graph","distinguished_perfect_matching","structured_proof_fields","topological_order"],"player_surface_preview":{"availability":"not_available","preview_asset_refs":[],"absence_md":""},"public_example_refs":[],"non_example_refs":[],"common_mistake_tags":[],"hint_reveal_public":["Hints should point attention to the visible structure before giving away the solution.","Reveals should show the answer path separately from independent evidence."],"public_evidence_signals":[{"id":"check_only","public_label":"Check only","teacher_note_md":"This observation can check the session without changing the next route by itself."}],"route_variants":[{"id":"support_repair","public_label":"Support","teacher_note_md":"Use a more guided version when recent work shows confusion or heavy help use."},{"id":"core","public_label":"Core","teacher_note_md":"Use the normal version after steady fresh solves."},{"id":"stretch_transfer","public_label":"Transfer","teacher_note_md":"Change representation or context after independent evidence stays strong."}],"presentation_profiles":[{"id":"presentation_compact","public_label":"Compact","teacher_note_md":"Use concrete objects, short prompts, and more visible support."},{"id":"presentation_standard","public_label":"Standard","teacher_note_md":"Use the same idea with more independent reading and representation."},{"id":"presentation_extended","public_label":"Extended","teacher_note_md":"Allow denser explanation, proof, and transfer when evidence supports it."}],"practice_focus_compatibility":[{"id":"practice-focus.word-problems.v1","public_label":"Word problems are confusing","teacher_note_md":"Schedule visual model or bar-model review when the story lane is incompatible."}],"challenge_enrichment_public":[],"story_fit_public":["story beats with visible logic state, manipulable evidence, and a bounded player action","Story object role: pigeonhole boxes.","Story object role: casework chips.","Story object role: move rules.","Story object role: target state cards.","Story object role: proof card."],"retrieval":{"aliases":["Unique-perfect-matching edge extremum proof","task-form.logic.unique-perfect-matching-edge-extremum-proof.v1","extremal_value_bound_construction_artifact","attaining_construction","balanced_bipartite_vertex_sets","compressed_directed_graph","distinguished_perfect_matching","structured_proof_fields","topological_order"],"teacher_questions":["What does Unique-perfect-matching edge extremum proof mean?","How does Unique-perfect-matching edge extremum proof adapt?","Can I see an example of Unique-perfect-matching edge extremum proof?"],"keywords":["unique-perfect-matching edge extremum proof","extremal_value_bound_construction_artifact","logic.olympiad.invariants-casework-pigeonhole","logic.proof-counterexample.artifacts","logic.combinatorics.counting-list"],"short_answer_public":"Unique-perfect-matching edge extremum proof asks the player to for a balanced finite bipartite graph constrained to have a unique perfect matching, submit the maximum edge count, an upper-bound certificate, and an attaining construction.","canonical_links":[{"label":"Unique-perfect-matching edge extremum proof","url":"#taskform-unique-perfect-matching-edge-extremum-proof"}],"safe_to_quote_snippets":["Unique-perfect-matching edge extremum proof asks the player to for a balanced finite bipartite graph constrained to have a unique perfect matching, submit the maximum edge count, an upper-bound certificate, and an attaining construction."],"example_refs":[]}},"canonical_target":{"href":"/math/skills/logic/olympiad-invariants-casework-pigeonhole#taskform-unique-perfect-matching-edge-extremum-proof","skill":{"schema_version":"teacher-skill-representation.v2","skill_ref":"logic.olympiad.invariants-casework-pigeonhole","domain_slug":"logic","skill_slug":"olympiad-invariants-casework-pigeonhole","canonical_url":"/math/skills/logic/olympiad-invariants-casework-pigeonhole","public_title":"Invariants, casework, and pigeonhole readiness","family_ref":"module-family.logic.constraint-deduction-combinatorics.v1","family_name":"Logic, Constraint, Deduction, and Combinatorics","pattern_cluster_refs":["pattern-cluster.logic.parity-invariants-move-reasoning.v1","pattern-cluster.logic.olympiad-method-adapters.v1","pattern-cluster.logic.proof-counterexample-truth-contradiction.v1","pattern-cluster.geom.transformations-composition-visualization.v1"],"task_pattern_refs":["task-pattern.logic.invariant-move-check.v1","task-pattern.logic.pigeonhole-guarantee.v1","task-pattern.logic.casework-coverage.v1","task-pattern.logic.olympiad-invariant-game.v1","task-pattern.logic.unique-perfect-matching-edge-extremum.v1","task-pattern.logic.orthogonal-grid-removal-counterexample-strategy.v1","task-pattern.geometry.geometric-network-optimization.v1","task-pattern.logic.switch-bulb-one-visit-identification.v1","task-pattern.logic.region-doorway-trail-start-choice.v1","task-pattern.logic.card-operation-move-count-pair-choice.v1","task-pattern.logic.transport-crossing-sequence-proof.v1"],"task_form_refs":["task-form.logic.invariant-move-legal-illegal-mark.v1","task-form.logic.pigeonhole-box-guarantee-choice.v1","task-form.logic.casework-cover-board.v1","task-form.logic.invariant-game-challenge-choice.v1","task-form.logic.unique-perfect-matching-edge-extremum-proof.v1","task-form.logic.orthogonal-grid-removal-counterexample-strategy.v1","task-form.geometry.network-optimization-cost-entry.v1","task-form.logic.switch-bulb-one-visit-identification.v1","task-form.logic.region-doorway-trail-start-choice.v1","task-form.logic.card-operation-move-count-pair-choice.v1","task-form.logic.transport-crossing-sequence-proof.v1"],"teacher_summary":"Invariants, casework, and pigeonhole readiness builds logic, constraint, deduction, and combinatorics through visual tasks, examples, and next-step routes.","teacher_explanation_md":"Use elementary olympiad-style methods such as invariant tracking, organized cases, and guarantee reasoning in visible puzzle settings.","player_surface_summary_md":"This skill appears in Invariant move legal-illegal mark, Pigeonhole box guarantee choice, Casework cover board, Invariant game challenge choice, Unique-perfect-matching edge extremum proof, Orthogonal-grid removal counterexample strategy, Geometric network minimum-cost entry, Switch-bulb one-visit identification, Region-doorway trail-start choice, Card-operation move-count pair choice, Transport-crossing sequence proof.","common_mistake_tags":["Tests a few cases and assumes the pattern is proved.","Tracks a quantity that does not actually stay fixed."],"hint_reveal_summary_md":"Hints keep attention on the visible structure; reveals show the path without counting as independent evidence.","adaptation_summary_md":"Fresh independent work can move toward Core, Transfer, or Challenge routes; help use or confusion keeps support visible.","route_variant_refs":["support_repair","core","stretch_transfer"],"presentation_profile_refs":["presentation_compact","presentation_standard","presentation_extended"],"practice_focus_refs":["practice-focus.balanced.v1","practice-focus.word-problems.v1"],"standards_refs":[],"school_program_refs":[],"challenge_refs":[],"story_fit_tags":["story beats with visible logic state, manipulable evidence, and a bounded player action","episodes with visible movement, fitting, nets, layers, grids, routes, or solid viewpoints"],"prerequisite_skill_refs":[],"next_skill_refs":["logic.parity.even-odd-reasoning","logic.proof-counterexample.artifacts"],"next_family_refs":["module-family.prealg.equations-expressions-inequalities.v1","module-family.geom.spatial-transformations-coordinates.v1","module-family.data.classification-tables-graphs.v1","module-family.oa.whole-number-operations-fluency.v1"],"public_example_refs":[],"retrieval":{"aliases":["Invariants, casework, and pigeonhole readiness","logic.olympiad.invariants-casework-pigeonhole","Logic, Constraint, Deduction, and Combinatorics","Invariant move legal-illegal mark","Pigeonhole box guarantee choice","Casework cover board","Invariant game challenge choice","Unique-perfect-matching edge extremum proof","Orthogonal-grid removal counterexample strategy","Geometric network minimum-cost entry","Switch-bulb one-visit identification","Region-doorway trail-start choice","Card-operation move-count pair choice","Transport-crossing sequence proof"],"teacher_questions":["What does Invariants, casework, and pigeonhole readiness mean?","How does Invariants, casework, and pigeonhole readiness adapt?","Can I see an example of Invariants, casework, and pigeonhole readiness?"],"keywords":["invariants, casework, and pigeonhole readiness","logic","olympiad-invariants-casework-pigeonhole","logic, constraint, deduction, and combinatorics","task-form.logic.invariant-move-legal-illegal-mark.v1","task-form.logic.pigeonhole-box-guarantee-choice.v1","task-form.logic.casework-cover-board.v1","task-form.logic.invariant-game-challenge-choice.v1","task-form.logic.unique-perfect-matching-edge-extremum-proof.v1","task-form.logic.orthogonal-grid-removal-counterexample-strategy.v1","task-form.geometry.network-optimization-cost-entry.v1","task-form.logic.switch-bulb-one-visit-identification.v1","task-form.logic.region-doorway-trail-start-choice.v1","task-form.logic.card-operation-move-count-pair-choice.v1","task-form.logic.transport-crossing-sequence-proof.v1"],"short_answer_public":"Invariants, casework, and pigeonhole readiness builds logic, constraint, deduction, and combinatorics through visual tasks, examples, and next-step routes.","canonical_links":[{"label":"Invariants, casework, and pigeonhole readiness","url":"/math/skills/logic/olympiad-invariants-casework-pigeonhole"}],"safe_to_quote_snippets":["Invariants, casework, and pigeonhole readiness builds logic, constraint, deduction, and combinatorics through visual tasks, examples, and next-step routes."],"example_refs":[]}}},"examples":[],"preview_artifacts":[]}