benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / For the following planar graphs, determine the number of vertices v, edges e, and faces f: i. v=9,e=16,f=9; ii. v=7,e=14,f=9. Verify Euler's formula v−e+f=2.

Problem

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

problem

For the following planar graphs, determine the number of vertices vv, edges ee, and faces ff: i. v=9,e=16,f=9v=9, e=16, f=9; ii. v=7,e=14,f=9v=7, e=14, f=9. Verify Euler's formula v−e+f=2v-e+f=2.
Plain-text mathematical notation (without MathML)
For the following planar graphs, determine the number of vertices v, edges e, and faces f: i. v=9,e=16,f=9; ii. v=7,e=14,f=9. Verify Euler's formula v−e+f=2.
Original LaTeX notation
For the following planar graphs, determine the number of vertices $v$, edges $e$, and faces $f$: i. $v=9, e=16, f=9$; ii. $v=7, e=14, f=9$. Verify Euler's formula $v-e+f=2$.

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
a722da01-7b1d-524f-a1f6-5bfa8723aa6b
task_key
test--a722da01-7b1d-524f-a1f6-5bfa8723aa6b
task_revision_id
1
config / split
/ test

Official source

initial import