The semi-random tree process

DOI10.1016/J.EJC.2025.104120MaRDI QIDQ7006234zbMATH OpenFDO

Authors Sofiya Burova, Lyuben Lichev

Publication date 31 March 2025

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

Full work available at URL https://doi.org/10.1016/J.EJC.2025.104120

zbMATH Keywords

Aldous-Broder algorithmonline semi-random graph process

Mathematics Subject Classification ID

Trees (05C05) Games on graphs (graph-theoretic aspects) (05C57) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) 2-person games (91A05) Games involving graphs (91A43)

Cites work

• A proof of the Kahn-Kalai conjecture
• Differential equations for random processes and random graphs
• Hamilton cycles in the semi-random graph process
• scientific article; zbMATH DE number 1342092 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 1405894 (Why is no real title available?)
• Introduction to Random Graphs
• Perfect matchings in the semirandom graph process
• Semi-random graph process
• Semi-random process without replacement
• Solutions of ordinary differential equations as limits of pure jump markov processes
• Subgraph games in the semi-random graph process and its generalization to hypergraphs
• The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
• Threshold functions
• Very fast construction of bounded-degree spanning graphs via the semi-random graph process

Cited in

(2)

• Creating subgraphs in semi-random hypergraph games
• Perfect matchings and loose Hamilton cycles in the semirandom hypergraph model

This page was built for publication: The semi-random tree process

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7006234)