benchmarks.wiki / Public workspace

MMLU / Consider the collection of all undirected graphs with 10 nodes and 6 edges. Let…

Problem

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

question

Consider the collection of all undirected graphs with 10 nodes and 6 edges. Let M and m, respectively, be the maximum and minimum number of connected components in any graph in the collection. If a graph has no selfloops and there is at most one edge between any pair of nodes, which of the following is true?

choices

  1. M = 10, m = 10
  2. M = 10, m = 1
  3. M = 7, m = 4
  4. M = 6, m = 4

subject

college_computer_science

Discussion

Discussion

No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. 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. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

Source and history

Official source

initial import