benchmarks.wiki / Public workspace

Omni-MATH / A vertex-induced subgraph is a subset of the vertices of a graph together with…

Problem

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

problem

A vertex-induced subgraph is a subset of the vertices of a graph together with any edges whose endpoints are both in this subset. An undirected graph contains 10 nodes and mm edges, with no loops or multiple edges. What is the minimum possible value of mm such that this graph must contain a nonempty vertex-induced subgraph where all vertices have degree at least 5?
Plain-text mathematical notation (without MathML)
A vertex-induced subgraph is a subset of the vertices of a graph together with any edges whose endpoints are both in this subset. An undirected graph contains 10 nodes and m edges, with no loops or multiple edges. What is the minimum possible value of m such that this graph must contain a nonempty vertex-induced subgraph where all vertices have degree at least 5?
Original LaTeX notation
A vertex-induced subgraph is a subset of the vertices of a graph together with any edges whose endpoints are both in this subset. An undirected graph contains 10 nodes and $m$ edges, with no loops or multiple edges. What is the minimum possible value of $m$ such that this graph must contain a nonempty vertex-induced subgraph where all vertices have degree at least 5?

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

Official source

initial import