Largest sparse subgraphs of random graphs

MaRDI QIDQ2857370zbMATH OpenFDO

Authors Nikolaos Fountoulakis, Ross J. Kang, Colin McDiarmid

Publication date 1 November 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571065311001260

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• Largest sparse subgraphs of random graphs
• Maximum sparse induced subgraphs of the binomial random graph with given number of edges
• scientific article; zbMATH DE number 932179
• Independent sets in random sparse graphs
• The densest subgraph problem in sparse random graphs

Cites work

• Cliques in random graphs
• scientific article; zbMATH DE number 1158743 (Why is no real title available?)
• scientific article; zbMATH DE number 3333197 (Why is no real title available?)
• On colouring random graphs
• Random graphs.
• The \(t\)-improper chromatic number of random graphs
• The \(t\)-stability number of a random graph
• The max quasi-independent set Problem
• The structure of hereditary properties and colourings of random graphs
• The t-improper chromatic number of random graphs

Cited in

(11)

• Dense subgraphs in random graphs
• Locally sparse graph with large density
• Maximum sparse induced subgraphs of the binomial random graph with given number of edges
• Largest sparse subgraphs of random graphs
• The densest subgraph problem in sparse random graphs
• Random Subgraphs in Sparse Graphs
• scientific article; zbMATH DE number 568829 (Why is no real title available?)
• The Largest Eigenvalue of Sparse Random Graphs
• Local structure theorems for Erdős-Rényi graphs and their algorithmic applications
• Second-order moments of the size of randomly induced subgraphs of given order
• The \(t\)-stability number of a random graph

This page was built for publication: Largest sparse subgraphs of random graphs

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