Largest sparse subgraphs of random graphs

DOI10.1016/j.ejc.2013.06.012zbMath1292.05232arXiv1203.0132OpenAlexW2135460127MaRDI QIDQ2509750

Nikolaos Fountoulakis, Ross J. Kang, Colin J. H. McDiarmid

Publication date: 29 July 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1203.0132

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Structural characterization of families of graphs (05C75) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (4)

On the sizes of large subgraphs of the binomial random graph ⋮ Maximum sparse induced subgraphs of the binomial random graph with given number of edges ⋮ Dense subgraphs in random graphs ⋮ The size of a maximum subgraph of the random graph with a given number of edges

Cites Work

• The \textsc{max quasi-independent set} problem
• The \(t\)-stability number of a random graph
• The t-improper chromatic number of random graphs
• The t-Improper Chromatic Number of Random Graphs
• On colouring random graphs
• Cliques in random graphs
• The structure of hereditary properties and colourings of random graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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