Cleaning random d-regular graphs with brooms

DOI10.1007/S00373-010-0986-XMaRDI QIDQ659724zbMATHOpenAlexFDO

Authors Paweł Prałat

Publication date 24 January 2012

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-010-0986-x

zbMATH Keywords

graph searchingcleaning with Broom numbercleaning with brushesdifferential equations methodrandom \(d\)-regular graphs

Mathematics Subject Classification ID

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

Recommendations

• Cleaning regular graphs with brushes
• Cleaning a network with brushes
• Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm
• Cleaning random graphs with brushes
• Cleaning with brooms

Cites work

• scientific article; zbMATH DE number 1342092 (Why is no real title available?)
• scientific article; zbMATH DE number 1405894 (Why is no real title available?)
• A note on bipartite subgraphs of triangle‐free graphs
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• A proof of alon's second eigenvalue conjecture
• Balanced vertex-orderings of graphs
• Clean the graph before you draw it!
• Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm
• Cleaning a network with brushes
• Cleaning random graphs with brushes
• Cleaning regular graphs with brushes
• Cleaning with brooms
• Differential equations for random processes and random graphs
• Expander graphs and their applications
• Explicit construction of linear sized tolerant networks
• Parallel cleaning of a network with brushes
• Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs
• Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs

Cited in

(10)

• Cleaning random graphs with brushes
• Burning graphs: a probabilistic perspective
• Brushing without capacity restrictions
• Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm
• Cleaning with brooms
• Parallel cleaning of a network with brushes
• Cleaning regular graphs with brushes
• \textsc{polish} -- Let us play the cleaning game
• Game brush number
• Brushing with additional cleaning restrictions

Describes a project that uses

Uses Software

• Maple

This page was built for publication: Cleaning random \(d\)-regular graphs with brooms

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