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

DOI10.1134/S1064562419050223zbMATH Open1434.05131WikidataQ126798575 ScholiaQ126798575MaRDI QIDQ2304366FDOQ2304366

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)

Cites Work

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

Cited In (3)

• 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

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)