Clutter percolation and random graphs

DOI10.1007/BFb0120903zbMath0447.60086OpenAlexW169898132MaRDI QIDQ3893098

Colin J. H. McDiarmid

Publication date: 1980

Published in: Mathematical Programming Studies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0120903

zbMATH Keywords

random graphshamiltonian cyclesclutter percolation theorem

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Paths and cycles (05C38) Combinatorial probability (60C05) Directed graphs (digraphs), tournaments (05C20)

Related Items

Colorful Hamilton Cycles in Random Graphs, The critical window in random digraphs, On large matchings and cycles in sparse random graphs, Packing Directed Hamilton Cycles Online, On the path separation number of graphs, Partitioning random graphs into large cycles, On rainbow Hamilton cycles in random hypergraphs, On a Correlation Inequality of Farr, Limit theorems for the spread of epidemics and forest fires, Cycle lengths in sparse random graphs, A scaling limit for the length of the longest cycle in a sparse random digraph, Packing, counting and covering Hamilton cycles in random directed graphs, Packing and counting arbitrary Hamilton cycles in random digraphs, Empirical Study of Phase Transition of Hamiltonian Cycle Problem in Random Graphs with Degrees Greater Than One, Packing, counting and covering Hamilton cycles in random directed graphs, A scaling limit for the length of the longest cycle in a sparse random graph, Closing gaps in problems related to Hamilton cycles in random graphs and hypergraphs, Random directed graphs are robustly Hamiltonian, Longest cycles in sparse random digraphs