benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Let G be a planar graph, which is also bipartite. Is it always possible to assign a vertex to each face of the graph such that no two faces have the same vertex assigned to them?

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

Let GG be a planar graph, which is also bipartite. Is it always possible to assign a vertex to each face of the graph such that no two faces have the same vertex assigned to them?
Plain-text mathematical notation (without MathML)
Let G be a planar graph, which is also bipartite. Is it always possible to assign a vertex to each face of the graph such  that no two faces have the same vertex assigned to them?
Original LaTeX notation
Let $G$ be a planar graph, which is also bipartite. Is it always possible to assign a vertex to each face of the graph such  that no two faces have the same vertex assigned to them?

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

task_id
7f0e9983-c342-55da-be4f-c8d03e7626e9
task_key
test--7f0e9983-c342-55da-be4f-c8d03e7626e9
task_revision_id
1
config / split
/ test

Official source

initial import