The size of a maximum subgraph of the random graph with a given number of edges

DOI10.1134/S1064562419050223MaRDI QIDQ2304366zbMATH OpenWikidataFDO

Authors Yanyan Li

Publication date 11 March 2020

Published in Doklady Mathematics (Search for Journal in Brave)

zbMATH Keywords

binomial random graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Extremal problems in graph theory (05C35) Distance in graphs (05C12) Enumeration in graph theory (05C30)

Recommendations

• Maximum sparse induced subgraphs of the binomial random graph with given number of edges
• On the sizes of large subgraphs of the binomial random graph
• On Subgraph Sizes in Random Graphs
• scientific article; zbMATH DE number 4087713
• Largest subgraph from a hereditary property in a random graph

Cites work

• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• Cliques in random graphs
• Disproof of the zero-one law for existential monadic properties of a sparse binomial random graph
• Independence numbers of random subgraphs of some distance graph
• Largest sparse subgraphs of random graphs
• Monadic second-order properties of very sparse random graphs
• On colouring random graphs
• On the probability of independent sets in random graphs
• On the stability of the independence number of a random subgraph
• Paths in graphs
• Random graphs: models and asymptotic characteristics
• The distribution of the maximum degree of a random graph

Cited in

(4)

• The inducibility of complete bipartite graphs
• On the sizes of large subgraphs of the binomial random graph
• Largest subgraph from a hereditary property in a random graph
• Maximum sparse induced subgraphs of the binomial random graph with given number of edges

This page was built for publication: The size of a maximum subgraph of the random graph with a given number of edges

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2304366)