Hamilton cycles in the semi-random graph process

DOI10.1016/j.ejc.2021.103423zbMath1480.91055arXiv2006.02599OpenAlexW3196392570MaRDI QIDQ2237858

Paweł Prałat, Pu Gao, Calum MacRury, Bogumił Kamiński

Publication date: 28 October 2021

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2006.02599

Mathematics Subject Classification ID

Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (3)

Power of \(k\) choices in the semi-random graph process ⋮ Sharp thresholds in adaptive random graph processes ⋮ Perfect Matchings in the Semirandom Graph Process

Uses Software

• Maple
• Ipopt
• Julia

Cites Work

• Unnamed Item
• Unnamed Item
• Hamiltonian circuits in random graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Julia: A Fresh Approach to Numerical Computing
• Hamilton cycles in 3-out
• Multi-Start Methods
• Semi‐random graph process
• Very fast construction of bounded-degree spanning graphs via the semi-random graph process
• JuMP: A Modeling Language for Mathematical Optimization

This page was built for publication: Hamilton cycles in the semi-random graph process