Large complete minors in random subgraphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3865318 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- An extremal function for contractions of graphs
- Coloring complete bipartite graphs from random lists
- Expanders -- how to find them, and what to find in them
- Finding and using expanders in locally sparse graphs
- Introduction to Random Graphs
- Long cycles in random subgraphs of graphs with large minimum degree
- Long paths and cycles in random subgraphs of \(\mathcal{H}\)-free graphs
- Long paths and cycles in random subgraphs of graphs with large minimum degree
- Lower bound of the Hadwiger number of graphs by their average degree
- On the non-planarity of a random subgraph
- Paths and cycles in random subgraphs of graphs with large minimum degree
- Probability Inequalities for Sums of Bounded Random Variables
- Random graphs.
- The extremal function for complete minors
- The phase transition in random graphs: a simple proof
- The threshold probability for long cycles
Cited in
(8)- scientific article; zbMATH DE number 1495914 (Why is no real title available?)
- Expansion in supercritical random subgraphs of the hypercube and its consequences
- scientific article; zbMATH DE number 1870233 (Why is no real title available?)
- On the non-planarity of a random subgraph
- Minors in small-set expanders
- Complete minors in cubic graphs with few short cycles and random cubic graphs.
- On random k-out subgraphs of large graphs
- Minors in random regular graphs
This page was built for publication: Large complete minors in random subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5886102)
