Spanning Subgraphs of Random Graphs
From MaRDI portal
Publication:4496437
DOI10.1017/S0963548399004150zbMath0964.05058MaRDI QIDQ4496437
Publication date: 14 August 2000
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548399004150
05C80: Random graphs (graph-theoretic aspects)
Related Items
Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs, Finding tight Hamilton cycles in random hypergraphs faster, The threshold for the square of a Hamilton cycle, Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs, Powers of tight Hamilton cycles in randomly perturbed hypergraphs, Optimal threshold for a random graph to be 2-universal, Edge Correlations in Random Regular Hypergraphs and Applications to Subgraph Testing, An Extension of the Blow-up Lemma to Arrangeable Graphs, Approximately Counting Embeddings into Random Graphs, On spanning structures in random hypergraphs, Powers of Hamilton cycles in pseudorandom graphs, Embedding spanning bounded degree subgraphs in randomly perturbed graphs, Random perturbation of sparse graphs, Unions of random trees and applications, Spanning trees in random graphs, Spanning structures and universality in sparse hypergraphs, Regular induced subgraphs of a random Graph, Explicit sparse almost-universal graphs for ${\bf {{\cal G}(n, {k \over n})}}$
