Regular subgraphs of random graphs
From MaRDI portal
Publication:5486304
Recommendations
Cites work
Cited in
(18)- The first \(k\)-regular subgraph is large
- \(k\)-regular subgraphs near the \(k\)-core threshold of a random graph
- On the threshold for k-regular subgraphs of random graphs
- scientific article; zbMATH DE number 3869382 (Why is no real title available?)
- scientific article; zbMATH DE number 1342092 (Why is no real title available?)
- Small subgraphs of random regular graphs
- Random subgraphs in Cartesian powers of regular graphs
- The property of having a \(k\)-regular subgraph has a sharp threshold
- scientific article; zbMATH DE number 7731163 (Why is no real title available?)
- On the number of circuits in random graphs
- (k+1)-Cores Have k-Factors
- Resolution of the Erdős–Sauer problem on regular subgraphs
- Threshold functions for small subgraphs in simple graphs and multigraphs
- Subgraphs of random match-graphs
- Connected balanced subgraphs in random regular multigraphs under the configuration model
- Regular graphs whose subgraphs tend to be acyclic
- The stripping process can be slow. II
- Subgraphs of Random Graphs
This page was built for publication: Regular subgraphs of random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5486304)