Tight Bounds on the Probabilistic Zero Forcing on Hypercubes and Grids

DOI10.37236/10585zbMath1514.05176arXiv2012.00216MaRDI QIDQ6354960

Paweł Prałat, Trent G. Marbach, Natalie C. Behague

Publication date: 30 November 2020

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

This page was built for publication: Tight Bounds on the Probabilistic Zero Forcing on Hypercubes and Grids