ProofAtlas

Hamiltonian graph theory · vertex-transitive graphs · group actions

Lovász Conjecture

Collaboration beta

Graph symmetry solves many special cases, yet no theorem currently turns all vertex-transitive graphs into one reusable Hamiltonian construction.

Gconnected and vertex-transitive⇒Ghas a Hamiltonian path
Known results and sources
Problem-first open-research thumbnail for Lovász Conjecture, showing an unresolved mathematical structure without a completion mark or navigation arrow.
Does symmetry force a spanning path? The page presents source-reported partial structure without claiming a proof.

Research problem

Exact mathematical statement

Every finite connected vertex-transitive graph has a Hamiltonian path.

Gconnected and vertex-transitive⇒Ghas a Hamiltonian pathG\text{ connected and vertex-transitive}\Longrightarrow G\text{ has a Hamiltonian path}

This remains open; the source reports partial results and route constraints, not a complete proof.

Problem infographic

Problem at a glance

Three-panel source-bound explainer for Lovász Conjecture: exact target, strongest retained result, and the unresolved closing bridge.
The source separates the exact target, retained partial results, and the still-open bridge.

Current mathematical picture

Where work on Lovász Conjecture stands

Open conjecture

Selected route highlights from the mathematical source. This is not yet a complete mathematical inventory.

Useful failureUnproved global orbital terminalization

A singleton-exterior atom is an explicit exception to an earlier structural shortcut. Atom expansion, endpoint diversity, transition pairings, and stronger group-theoretic Hamiltonicity remain viable.

Route status · Narrowed route
Main reductionCurrent reduction

Optimize a minimum path cover, analyze negative-excess atoms and their exteriors, and reconnect controlled quotient or transition structures into one spanning path.

Evidence posture · Source-reported route statement · dependencies incomplete
Priority open bridgeProve or refute orbital terminalization.Task status · Ready to work on
Research-record correctionResearch-record correction

We corrected the cited passages. We updated the highlighted open task or route. The mathematical claims and their status did not change.

Reader-facing record corrected; mathematics unchanged

Work mapped so far

Lovász Conjecture in numbers

1.6kretained lines of mathematical investigation1,650 in the current working snapshot
Argument development
1,348 · 82%
Explored or eliminated routes
61 · 4%
Computational analysis
13 · 1%
Open obligations
119 · 7%
Definitions and setup
109 · 7%
7selected mapped statements1routes investigated3open questions3contribution-ready tasks
How this is measured

This measures retained mathematical investigation, not proximity to a proof. Code, data, logs, repeated text, operational instructions, and generated presentation copy are excluded.

Status checkedAug 21, 2026
Source recordedAug 21, 2026

Argument map and routes

How the current approaches connect

Claims, reductions, open questions, active routes, and narrowed alternatives in one mathematical map.

Visible working map

Research route map

11 selected steps

Selected claims, active routes, useful failures, and open questions from the current research map. Arrows appear only for explicitly recorded relationships.

11 selected steps

Scroll horizontally to explore the route

Working route overview for Lovász ConjectureA selected map of recorded claims, active routes, useful failures, open questions, and their explicit relationships. Search, filter, zoom, or pan within this page.Does symmetry force a spanning path? — Depends on missing premiseDoes symmetry force aspanning path?Current reduction — Depends on missing premiseCurrent reductionHamiltonian-path target — Depends on missing premiseHamiltonian-path targetNegative-excess atom route — Depends on missing premiseNegative-excess atom routeClosing target — Depends on missing premiseClosing targetLow-connectivity families — Depends on missing premiseLow-connectivity familiesSingleton-exterior exception — Depends on missing premiseSingleton-exterior exceptionUnproved global orbital terminalization — stoppedUnproved global orbitalterminalizationProve or refute orbital terminalization. — OpenProve or refute orbitalterminalization.Force two compatible atom attachments. — OpenForce two compatible atomattachments.Control reconnection permutations and primitive cases. — OpenControl reconnectionpermutations and primitivecases.
Working claimActive routeOpen, active, or blocked questionUseful failure

Working overview, not proof. The map shows selected recorded relationships; more nodes or edges do not establish correctness or completion.

Explored alternatives

Other routes

1 recorded
Narrowed routeUnproved global orbital terminalization

A singleton-exterior atom is an explicit exception to an earlier structural shortcut. Atom expansion, endpoint diversity, transition pairings, and stronger group-theoretic Hamiltonicity remain viable.

Route status · Narrowed route

More ways to contribute

Open questions

Additional prepared tasks for exploring this research frontier.

3 featured tasks
01
Prove or refute orbital terminalization.Suggested move: Prove a reusable orbital terminalization lemma or a bypass that preserves the low-quotient theorem.
Ready to work on
02
Force two compatible atom attachments.Suggested move: Use atom endpoint diversity to select two compatible attachments through the separator.
Ready to work on
03
Control reconnection permutations and primitive cases.Suggested move: Test repeated-hit pairing graphs and develop a closing mechanism for the primitive branch.
Ready to work on

Sourced mathematical context

The known mathematical landscape

Context collected Aug 21, 2026
Current statusOpen conjecture

Recent work continues to call the Hamiltonian-path conjecture open while improving long-cycle and decomposition bounds; many graph classes are known separately.

[1][2]
External progress

What the literature has established

Selected external milestones in reverse chronological order, with their evidence posture.

  1. PreprintTowards the Lovász conjecture via sublinear expanders supplies a representative external result or boundary relevant to the problem; it is not treated here as a proof of the full packet target.[1]
  2. Peer reviewedHamiltonian cycles and paths in vertex-transitive graphs with abelian and nilpotent groups supplies a representative external result or boundary relevant to the problem; it is not treated here as a proof of the full packet target.[2]
2 cited sources1 related results or reductionsReferences

Mathematical neighborhood

Related results and reusable starting points

Current focusLovász Conjecture
Related problemLovász Conjecture

Recent work continues to call the Hamiltonian-path conjecture open while improving long-cycle and decomposition bounds; many graph classes are known separately.

[1][2]

Formalization opportunities

Lean work can make these reusable foundations precise without being presented as a proof of the core problem.

  • Formalization targetA formal statement matching the exact public target and all quantifiers.
  • Formalization targetFormal libraries for the principal mathematical structures used by the strongest route.
  • Formalization targetA checked closing argument for the source-identified open bridge.

Research-record corrections

What changed in the research record

These notes describe corrections to cited passages, highlighted tasks, or connections between claims. The mathematical claims and their status did not change.

Research-record correctionWe corrected the cited passages. We updated the highlighted open task or route. The mathematical claims and their status did not change.

Corrected the research recordCorrection note

Correction details
Research-record correctionWe corrected the cited passages. We removed a duplicate or outdated task or route step. We updated the highlighted open task or route. The mathematical claims and their status did not change.

Corrected the research recordCorrection note

Correction details

The initial argument structure appears separately. Uploads, model runs, and presentation changes do not count as mathematical updates.

Detailed research inventory

Claims, milestones, and routes in the current map

This view highlights the mathematical statements most useful for following the current route.

4 standing statements3 proposed statements3 open questions1 narrowed routes
Statements by mathematical role7 selected mapped statements
  • theorem candidate1 of 71
  • reduction2 of 72
  • lemma2 of 72
  • equivalence1 of 71
  • counterexample1 of 71
Selected mathematical clusters1 mathematical clusters
Current research mapThe conjecture, retained reductions, explored limitations, and open questions represented in this overview.20 displayed rows · 1 route included
  • retained route statementDoes symmetry force a spanning path?
  • retained route statementCurrent reductionintermediate
  • retained route statementClosing targetintermediate
  • retained route statementHamiltonian-path targetintermediate
  • retained route statementNegative-excess atom routeintermediate
  • retained route statementLow-connectivity familiesintermediate
  • retained route statementSingleton-exterior exceptionintermediate
  • Recorded relationshipThe source reports this as a route toward the conjecture; missing or unaudited premises remain and the reduction does not itself prove the target.supports · reported by source
  • Recorded relationshipThis source-reported claim supports the retained route only within its stated, unaudited scope.supports · reported by source
  • Recorded relationshipThis source-reported claim supports the retained route only within its stated, unaudited scope.supports · reported by source
  • Recorded relationshipThis source-reported claim supports the retained route only within its stated, unaudited scope.supports · reported by source
  • Recorded relationshipThis source-reported counterexample narrows one intermediate strategy; it does not challenge the open conjecture.challenges · reported by source
  • DerivationThe source reports that completing the closing target would advance the reduction to the main conjecture; this remains an informal route, not a verified derivation.proposed
  • Useful failureUnproved global orbital terminalizationreported failure
  • Research targetProve or refute orbital terminalization.open
  • Research targetForce two compatible atom attachments.open
  • Research targetControl reconnection permutations and primitive cases.open
  • Research targetOrbital terminalizationsuperseded
  • Research targetPrimitive branchsuperseded
  • Narrowed routeUnproved global orbital terminalizationA singleton-exterior atom is an explicit exception to an earlier structural shortcut. Atom expansion, endpoint diversity, transition pairings, and stronger group-theoretic Hamiltonicity remain viable.
How to interpret these counts

A statement may be a lemma, conditional reduction, special case, documented limitation, or open target. These counts describe the work's structure; they do not estimate distance to a proof.

Research outlook

Conditions that would advance the current route

Priority open bridgeProve or refute orbital terminalization.

1 approach has already been tested and narrowed. The task above is the current priority within the larger open route.

Evidence needed nextConcrete conditions for progress

A result can change the outlook by closing the bridge, narrowing its scope, or showing that the route cannot work.

  • Supply a complete argument with every imported premise identified.
  • Survive an independent attempt to falsify the proposed step.

Continue the mathematics

Contribute

ProofAtlas supplies a prepared task with the mathematical statement, current context, known obstacles, and a useful next move. Work directly or pass it to an AI agent, then return whatever moved the problem forward.

Read-only beta · actions unavailable
Prepared starting pointProve or refute orbital terminalization.

Lovász Conjecture · ready to start

Mathematical updatesFollow this problem

Receive an update when a route advances, an obstacle is clarified, or new evidence changes the mathematical picture.

Research contextPrepared context for any AI agent

Graph symmetry solves many special cases, yet no theorem currently turns all vertex-transitive graphs into one reusable Hamiltonian construction.

  • Exact question and boundaries
  • Current routes and known obstacles
  • What a useful result should report
Return mathematical workReturn what you or your agent found

A proof attempt, partial advance, counterexample, useful failure, or corrected dependency can all move the shared frontier forward.

Proof attempt or partial resultSupporting notes or data
Hosted agentRun this task with a hosted agent

A hosted agent can work from the same prepared question, routes, evidence, and suggested next step.

Your own AI agentConnect an outside research agent

Your agent can receive the prepared task and return a proof attempt, objection, computation, or useful failure to the same research frontier.

Sources and references2 cited works · next context review by Nov 21, 2026

The mathematical context was checked on Aug 21, 2026. Status can be refreshed sooner after a material result or claim.

  1. 1
    Towards the Lovász conjecture via sublinear expanderspreprint · Matija Bucić, Micha Christoph, Alexey Pokrovskiy, Raphael Steiner · arXiv · 2026 · accessed Aug 21, 2026
  2. 2
    Hamiltonian cycles and paths in vertex-transitive graphs with abelian and nilpotent groupspeer reviewed result · Marc J. Lipman · Discrete Mathematics · 1985 · accessed Aug 21, 2026

Important qualifications

  • This was a bounded status and identity check, not an exhaustive bibliography, priority review, or legal review.
  • Private packet claims were not treated as external authority; submitted links and attachments were not executed or actively rendered.
  • No absence claim is inferred from the bounded search, and recent preprints remain subject to ordinary scholarly review.

Continue exploring

Compare another research frontier

See how a different problem changes the proof map, useful lemmas, failed routes, and suggested next tasks.

Explore all research workspaces

Expanded visual

Open original image