math.CO — Combinatorics
A characterization of cut-percolating bigraphs
Conlon and Lee introduced reflection bigraphs and cut-percolation in their study of graph norms. We prove that, for connected bigraphs, these two notions coincide, confirming their prediction.
Primarily AI-generated textHuman understanding: some partsCoxeter groupsSidorenko's conjectureblock designscut-percolationgraph isomorphismgraph normsreflection groupsweakly norming graphs