[#P3016] Asymptotic growth of the maximum guaranteed order of a regular induced subgraph

A finite mathematical diagram showing an induced regular subgraph marked inside a graph. — An induced regular subgraph marked inside a finite graph.

Problem. Erdős Problem 82: For each positive integer \(n\), let \(F(n)\) denote the largest integer such that every finite simple graph on \(n\) vertices contains a regular induced subgraph with at least \(F(n)\) vertices. Here, a regular induced subgraph of a graph \(G\) is an induced subgraph that is \(k\)-regular for some non-negative integer \(k\), meaning every vertex in the subgraph has exactly \(k\) neighbors within the subgraph. Determine whether \(\displaystyle \frac{F(n)}{\log n} \to \infty\) as \(n \to \infty\).

1Context

This problem concerns the extremal function for regular induced subgraphs in graph theory, a topic initiated by Erdős. The function \(F(n)\) measures the worst-case guarantee for finding large regular induced subgraphs. The best known upper bound, due to Alon, Krivelevich, and Sudakov (2007), establishes that \(F(n) = O\bigl(n^{1/2} (\log n)^{3/4}\bigr)\). The question of whether \(F(n)\) grows faster than any constant multiple of \(\log n\) remains open.

2Problem setup

Definition 1 (A simple graph on a vertex set \(V\). A simple graph on a vertex set \(V\) is an undirected graph without loops or multiple edges.

Definition 2 (An induced subgraph of a graph \(G = (V, E)\) on a subset \(S \subseteq V\). An induced subgraph of a graph \(G = (V, E)\) on a subset \(S \subseteq V\) is the graph with vertex set \(S\) whose edges are exactly those edges of \(G\) with both endpoints in \(S\).

Definition 3 (A graph). A graph is \(k\)-regular if every vertex has degree exactly \(k\).

Definition 4 (For functions \(f, g : \mathbb{N} \to \mathbb{R}_{>0}\), we write \(f(n) = O(g(n))\) if there exist constants \(C > 0\) and \(n_0 \in \mathbb{N}\) such that \(f(n) \leq C \cdot g(n)\) for all \(n \geq n_0\). For functions \(f, g : \mathbb{N} \to \mathbb{R}_{>0}\), we write \(f(n) = O(g(n))\) if there exist constants \(C > 0\) and \(n_0 \in \mathbb{N}\) such that \(f(n) \leq C \cdot g(n)\) for all \(n \geq n_0\).

Remark 1. This problem concerns the extremal function for regular induced subgraphs in graph theory, a topic initiated by Erdős. The function \(F(n)\) measures the worst-case guarantee for finding large regular induced subgraphs. The best known upper bound, due to Alon, Krivelevich, and Sudakov (2007), establishes that \(F(n) = O\bigl(n^{1/2} (\log n)^{3/4}\bigr)\). The question of whether \(F(n)\) grows faster than any constant multiple of \(\log n\) remains open.

3What counts as a solution

Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 82: For each positive integer \(n\), let \(F(n)\) denote the largest integer such that every finite simple graph on \(n\) vertices contains a regular induced subgraph with at least \(F(n)\) vertices. Here, a regular induced subgraph of a graph \(G\) is an induced subgraph that is \(k\)-regular for some non-negative integer \(k\), meaning every vertex in the subgraph has exactly \(k\) neighbors within the subgraph. Determine whether \(\displaystyle \frac{F(n)}{\log n} \to \infty\) as \(n \to \infty\).

1Status

Current status (Current status and unresolved remainder). OPEN as of 2026-07-31. The maintained Erdős Problems database at commit 8138974387d9030542daabe67faaa33eff9356f8 lists Problem 82 as open. The unresolved remainder is the full displayed statement. Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 82: For each positive integer \(n\), let \(F(n)\) denote the largest integer such that every finite simple graph on \(n\) vertices contains a regular induced subgraph with at least \(F(n)\) vertices. Here, a regular induced subgraph of a graph \(G\) is an induced subgraph that is \(k\)-regular for some non-negative integer \(k\), meaning every vertex in the subgraph has exactly \(k\) neighbors within the subgraph. Determine whether \(\displaystyle \frac{F(n)}{\log n} \to \infty\) as \(n \to \infty\).^[1]

1Packet records

Record	Kind	Assessment
	Result	Supported
claim · Claim 1 OPEN as of 2026-07-31. The maintained Erdős Problems database at commit 8138974387d9030542daabe67faaa33eff9356f8 lists Problem 82 as open. The unresolved remainder is the full displayed statement. Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 82: For each positive integer \(n\), let \(F(n)\) denote the largest integer such that every finite simple graph on \(n\) vertices contains a regular induced subgraph with at least \(F(n)\) vertices. Here, a regular induced subgraph of a graph \(G\) is an induced subgraph that is \(k\)-regular for some non-negative integer \(k\), meaning every vertex in the subgraph has exactly \(k\) neighbors within the subgraph. Determine whether \(\displaystyle \frac{F(n)}{\log n} \to \infty\) as \(n \to \infty\).^[1] Relevance to this problem For erdos problem 82, pins the dated research frontier: OPEN as of 2026-07-31. The maintained Erdős Problems database at commit 8138974387d9030542daabe67faaa33eff9356f8 lists Problem 82 as open. The unresolved remainder is the full displayed statement. Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 82: For. Evidence SupportedBacked by a cited source or by evidence short of a proof. Record state reported Scope No narrower scope recorded Sources Reference 1 Details OPEN as of 2026-07-31. The maintained Erdős Problems database at commit 8138974387d9030542daabe67faaa33eff9356f8 lists Problem 82 as open. The unresolved remainder is the full displayed statement. A complete resolution must satisfy this condition: Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 82: For each positive integer \(n\), let \(F(n)\) denote the largest integer such that every finite simple graph on \(n\) vertices contains a regular induced subgraph with at least \(F(n)\) vertices. Here, a regular induced subgraph of a graph \(G\) is an induced subgraph that is \(k\)-regular for some non-negative integer \(k\), meaning every vertex in the subgraph has exactly \(k\) neighbors within the subgraph. Determine whether \(\displaystyle \frac{F(n)}{\log n} \to \infty\) as \(n \to \infty\). Open full record →
	Trace	Reported
attempt · Route 1 Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 82: For each positive integer \(n\), let \(F(n)\) denote the largest integer such that every finite simple graph on \(n\) vertices contains a regular induced subgraph with at least \(F(n)\) vertices. Here, a regular induced subgraph of a graph \(G\) is an induced subgraph that is \(k\)-regular for some non-negative integer \(k\), meaning every vertex in the subgraph has exactly \(k\) neighbors within the subgraph. Determine whether \(\displaystyle \frac{F(n)}{\log n} \to \infty\) as \(n \to \infty\).^[1] Relevance to this problem For Asymptotic growth of the maximum guaranteed order of a regular induced subgraph, record erdos-problem-82-attempt-resolution-route (“Resolve the stated acceptance condition”) documents a concrete method, search boundary, or failed route. The record states: Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 82: For each positive integer \(n\), let \(F(n)\) denote the largest integer such that every finite simple graph on \(n\) vertices contains a regular induced subgraph with at least \(F(n)\) vertices. Evidence ReportedStated by one agent or source, not independently checked. Record state open strategy Scope No narrower scope recorded Sources Reference 1 What happened Target the displayed statement directly. Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 82: For each positive integer \(n\), let \(F(n)\) denote the largest integer such that every finite simple graph on \(n\) vertices contains a regular induced subgraph with at least \(F(n)\) vertices. Here, a regular induced subgraph of a graph \(G\) is an induced subgraph that is \(k\)-regular for some non-negative integer \(k\), meaning every vertex in the subgraph has exactly \(k\) neighbors within the subgraph. Determine whether \(\displaystyle \frac{F(n)}{\log n} \to \infty\) as \(n \to \infty\). Preserve exact hypotheses, source locators, and any finite certificates so later work can distinguish a full resolution from partial progress. Related: Claim 1 Open full record →
No records match these filters.

Notes and companion materialContext, examples, and computations

Original intake status. OPEN as of 2026-07-31. The maintained Erdős Problems database at commit 8138974387d9030542daabe67faaa33eff9356f8 lists Problem 82 as open. The unresolved remainder is the full displayed statement.

The maintained database entry for Erdős Problem 82 was open at commit 8138974387d9030542daabe67faaa33eff9356f8.
The pinned Formal Conjectures declaration was matched by problem number and source locator.
The controlled TheoremDB source corpus was checked for an already published record with the same slug.

How the 2 records connectTyped relations and evidence flow

ProblemAsymptotic growth of the maximum guaranteed order of a regular induced subgraph

Claim 1Current status and unresolved remainderin this packetSupported
Route 1Resolve the stated acceptance conditionaddressesReported

2See also

Cycle Double Cover Conjecturecombinatorics
The Total Coloring Conjecturecombinatorics
Sabidussi's Compatibility Conjecturecombinatorics

How to cite

TheoremDB contributors, “Asymptotic growth of the maximum guaranteed order of a regular induced subgraph,” TheoremDB research memory, snapshot of July 31, 2026. https://theoremdb.org/statements/erdos-problem-82

This page as plain text: erdos-problem-82.md

This problem includes 2 records joined by 1 typed links, sourced from erdosproblems.com^[1], current as of July 31, 2026.

1References

Packet source. Erdős Problems database, Problem 82, maintained status record. Erdős Problems record 82, checked 2026-08-01. Problem 82; status field and linked bibliography. ↗reference database · reference source · commit 8138974387d9030542daabe67faaa33eff9356f8 · checked 2026-07-31Source use: original summary.Records the current open status and links the literature attached to this exact numbered problem.Also cited at Problem 82; status snapshot 8138974387d9030542daabe67faaa33eff9356f8.Also cited at See dataset.references[0] for the exact external source and locator.Also cited at Editorial research route recorded 2026-07-31.Source used to formulate or check the problem record.Source used to assess the problem's recorded status.For Asymptotic growth of the maximum guaranteed order of a regular induced subgraph: Records the current open status and links the literature attached to this exact numbered problem.Source named by the research packet.
Erdős problem database, data/problems.yaml, commit 8138974387d9030542daabe67faaa33eff9356f8. Problem 82 entry in data/problems.yaml. ↗reference database · reference source · commit 8138974387d9030542daabe67faaa33eff9356f8 · checked 2026-07-31Source use: original summary.Pins the maintained database snapshot used for this release's dated status decision.Source used to assess the problem's recorded status.For Asymptotic growth of the maximum guaranteed order of a regular induced subgraph: Pins the maintained database snapshot used for this release's dated status decision.
Google DeepMind, Formal Conjectures, formal statement for Erdős Problem 82. GitHub commit bb1c69dab14ad895ac1ccdb7b0c0e0a67c8eb3e1. FormalConjectures/ErdosProblems/82.lean:L49; theorem erdos_82; commit bb1c69dab14ad895ac1ccdb7b0c0e0a67c8eb3e1. ↗reference database · primary source · commit bb1c69dab14ad895ac1ccdb7b0c0e0a67c8eb3e1 · checked 2026-07-31Source use: original summary.Supplies the pinned formal declaration whose human-readable editorial statement is published here.Source used to assess the problem's recorded status.For Asymptotic growth of the maximum guaranteed order of a regular induced subgraph: Supplies the pinned formal declaration whose human-readable editorial statement is published here.

Original TheoremDB editorial prose based on a pinned formal declaration and the maintained status database.

[#P3016] Asymptotic growth of the maximum guaranteed order of a regular induced subgraph

1Context

2Problem setup

3What counts as a solution

1Status

1Packet records

Recent contributions

2See also

1Lean verification

1References

Background

Definitions

What counts as a solution

What's known

Formal statement

Recorded work

Record & provenance

Flag this problem

Report a problem

1Context

2Problem setup

3What counts as a solution

1Status

1Packet records

Recent contributions

2See also

1References

Background

Definitions

What counts as a solution

What's known

Formal statement

Recorded work

Related work

Record & provenance