Spanning subgraphs of random graphs
From MaRDI portal
Recommendations
- Spanning Subgraphs of Random Graphs
- Random Subgraphs in Sparse Graphs
- Distributions of sparse spanning subgraphs in random graphs
- Subgraphs of Random Graphs
- Random graphs and their subgraphs
- Spanning maximal planar subgraphs of random graphs
- Distribution of the number of spanning regular subgraphs in random graphs
- scientific article; zbMATH DE number 3943865
- On spanning structures in random hypergraphs
- scientific article; zbMATH DE number 747032
Cites work
Cited in
(38)- Weakly saturated subgraphs of random graphs
- Thresholds versus fractional expectation-thresholds
- The size‐Ramsey number of cubic graphs
- Large-scale structures in random graphs
- Spanning maximal planar subgraphs of random graphs
- Spanning structures and universality in sparse hypergraphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Sparse partition universal graphs for graphs of bounded degree
- Distributions of sparse spanning subgraphs in random graphs
- Ore-type versions of Brooks' theorem
- Threshold Functions for H-factors
- A note on spanning \(K_r\)-cycles in random graphs
- Grids in random graphs
- On the extremal function for graph minors
- Spanning F-cycles in random graphs
- Equitable coloring of random graphs
- scientific article; zbMATH DE number 3628985 (Why is no real title available?)
- Random Subgraphs in Sparse Graphs
- Equitable list coloring of sparse graphs
- Weak saturation stability
- Spanning trees in random graphs
- On spanning structures in random hypergraphs
- An Ore-type theorem on equitable coloring
- Maximum chordal subgraphs of random graphs
- Almost spanning universality in random graphs
- Universality of random graphs and rainbow embedding
- \(H(n)\)-factors in random graphs
- Optimal threshold for a random graph to be 2-universal
- A fast algorithm for equitable coloring
- On the lower bound on the length of relaxed locally decodable codes
- Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture
- A lower bound on the average degree forcing a minor
- Random perturbation of sparse graphs
- Star saturation number of random graphs
- Embedding spanning bounded degree subgraphs in randomly perturbed graphs
- A refinement of a result of Corrádi and Hajnal
- Sharpening an ore-type version of the Corrádi-Hajnal theorem
- Saturation numbers of bipartite graphs in random graphs
This page was built for publication: Spanning subgraphs of random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1187953)
