Spanning subgraphs of random graphs
From MaRDI portal
Publication:1187953
DOI10.1007/BF01271712zbMath0767.05082OpenAlexW2001021855WikidataQ105583433 ScholiaQ105583433MaRDI QIDQ1187953
Publication date: 3 August 1992
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01271712
Related Items (24)
On spanning structures in random hypergraphs ⋮ Threshold Functions for H-factors ⋮ The size‐Ramsey number of cubic graphs ⋮ Sharpening an ore-type version of the Corrádi-Hajnal theorem ⋮ A lower bound on the average degree forcing a minor ⋮ Spanning structures and universality in sparse hypergraphs ⋮ Weak saturation stability ⋮ On the extremal function for graph minors ⋮ Embedding spanning bounded degree subgraphs in randomly perturbed graphs ⋮ Star saturation number of random graphs ⋮ Sparse partition universal graphs for graphs of bounded degree ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ An Ore-type theorem on equitable coloring ⋮ Thresholds versus fractional expectation-thresholds ⋮ \(H(n)\)-factors in random graphs ⋮ A refinement of a result of Corrádi and Hajnal ⋮ A fast algorithm for equitable coloring ⋮ Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture ⋮ Equitable coloring of random graphs ⋮ Random perturbation of sparse graphs ⋮ Ore-type versions of Brooks' theorem ⋮ Universality of random graphs and rainbow embedding ⋮ Optimal threshold for a random graph to be 2-universal ⋮ Spanning trees in random graphs
Cites Work
This page was built for publication: Spanning subgraphs of random graphs
