Bigraph percolation problems
arXiv:2408.14257
Abstract
A bigraph is weakly norming if the th root of the density of in is a norm in the space of bounded measurable functions . The only known technique, due to Conlon--Lee, to show that a bigraph is weakly norming is to present a cut-percolation sequence of . In this paper, we identify a key obstacle for cut-percolation, which we call fold-stability and we show that existence of a cut-percolating of a bigraph is equivalent to non-existence of non-monochromatic fold-stable colorings of the edges of .
arXiv comment41 pages. (This version fixes a crucial typo in the definition of a fold (2.6.2): must be a union of connected components of (not of ).)