Sequentially Constrained Hamilton Cycles in Random Graphs

ABSTRACT We discuss the existence of Hamilton cycles in the random graph where there are restrictions caused by (i) coloring sequences, (ii) a subset of vertices must occur in a specific order, and (iii) there is a bound on the number of inversions in the associated permutation.

Authors

Wesley Pegden (ORCID: https://orcid.org/0000-0002-3680-1817)
Alan Frieze (ORCID: https://orcid.org/0000-0002-8481-5615)

Institutions

Carnegie Mellon University (US)

Publication Details

Journal: Random Structures and Algorithms
Published: 2025-08-01
DOI: https://doi.org/10.1002/rsa.70027
Primary Topic: Limits and Structures in Graph Theory
Type: article
Field-Weighted Citation Impact: 0.00

Funders

National Science Foundation

Controls

|||

ALL TIME

JAN

FEB

MAR

APR

MAY

JUN

JUL

AUG

SEP

OCT

article

Sequentially Constrained Hamilton Cycles in Random Graphs

Wesley Pegden, Alan Frieze

Aug 1, 2025

Random Structures and Algorithms

Limits and Structures in Graph Theory

article

Sequentially Constrained Hamilton Cycles in Random Graphs

Wesley Pegden, Alan Frieze

August 1, 2025article en

Abstract

Random Structures and AlgorithmsVol. 67(1)

Carnegie Mellon University (US)

National Science Foundation

Openalex Percentile: Top 73%

Limits and Structures in Graph Theory

DOI Open Access PDF OpenAlex

AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Sequentially Constrained Hamilton Cycles in Random Graphs — Wesley Pegden, Alan Frieze · Random Structures and Algorithms (2025) | TGRS Research Map | TGRS