{"id":"hexagon/2610.00193","pdf":"https://hexagonmath.org/pdf/2610.00193v1","url":"https://hexagonmath.org/abs/2610.00193v1","tags":["math.GR","cs.DM","msc:05C25","msc:20F55","msc:05C50","Coxeter groups","Sidorenko's conjecture","block designs","cut-percolation","graph isomorphism"],"score":0,"title":"A characterization of cut-percolating bigraphs","domain":"math.CO","origin":"ai-generated","source":"hexagon","authors":["Václav Rozhoň"],"reviews":0,"subject":"math.CO","summary":"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.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"ai_models":["ChatGPT"],"discussed":0,"published":"2026-10-11","reactions":{},"withdrawn":false,"authorship":"no-human-author-claimed","formalized":false,"human_understanding":"some"}