Colouring random subgraphs

DOI10.1017/S0963548325000069MaRDI QIDQ6879468zbMATH OpenFDO

Authors Boris Bukh, Michael Krivelevich, Bhargav P. Narayanan

Publication date 30 December 2025

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0963548325000069

zbMATH Keywords

bootstrap percolationcolouring numberdegeneracy

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Random graphs (graph-theoretic aspects) (05C80)

Cites work

• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• A simple model of global cascades on random networks
• Bootstrap percolation on the random graph \(G_{n,p}\)
• Bootstrap percolation on the random regular graph
• Cubic Ramanujan graphs
• Expander graphs and their applications
• Fractional chromatic number of a random subgraph
• Girth in graphs
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• scientific article; zbMATH DE number 3308988 (Why is no real title available?)
• scientific article; zbMATH DE number 3349865 (Why is no real title available?)
• On chromatic number of graphs and set-systems
• Random minimum length spanning trees in regular graphs
• Subgraphs with a large cochromatic number
• The chromatic number of random graphs
• The probabilistic method
• Which Networks are Least Susceptible to Cascading Failures?

This page was built for publication: Colouring random subgraphs

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