Tree-Matchings in Graph Processes
Copyright policy )Tree-Matchings in Graph Processes
The authors consider the hitting times of nonmonotone graph properties involving tree matchings in a random graph process. They extend the results of \textit{B. Bollobás} and \textit{A. M. Frieze} [On matchings and Hamiltonian cycles in random graphs, Random graphs '83, Lect. 1st Semin., Poznań/Pol. 1983, Ann. Discrete Math. 28, 23-46 (1985; Zbl 0592.05052)] and \textit{B. Bollobás} and \textit{A. Thomason} [Random graphs of small order, Random graphs '83, Lect. 1st Semin., Poznań/Pol. 1983, Ann. Discrete Math. 28, 47-97 (1985; Zbl 0588.05040)].
tree matchings, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Random graphs (graph-theoretic aspects), hitting times, random graph
tree matchings, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Random graphs (graph-theoretic aspects), hitting times, random graph
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).11 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!