scientific article; zbMATH DE number 3943864
From MaRDI portal
Publication:3715149
[For the entire collection see Zbl 0582.00006.] A random graph of order n with independent edges of a common fixed probability p is considered. The asymptotic order is obtained of the largest bipartite complete induced subgraph.
Recommendations
Cited in
(6)- On the sizes of large subgraphs of the binomial random graph
- Random bipartite graphs
- Upper bounds on the order of nearly regular induced subgraphs in random graphs
- scientific article; zbMATH DE number 4087713 (Why is no real title available?)
- Dense Induced Subgraphs of Dense Bipartite Graphs
- Maximum induced subgraphs of the binomial random graph
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3715149)