HEXAGONbeta

A characterization of cut-percolating bigraphs

Primarily AI-generated textHuman understanding: some partsmath.CO — Combinatoricsmath.GR — Group Theorycs.DM — Discrete Mathematics

Contributed by Václav Rozhoň ↗

Version 1 / Oct 11, 2026 / CC BY 4.0

Abstract

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.

Provenance statement

Exploration with GPT6.

Tools used

OpenAI
ChatGPTVersion GPT6

References

  1. C. Amarra, A. Devillers, and C. E. Praeger, Chain-imprimitive, flag-transitive 22-designs , Designs, Codes and Cryptography 92 (2024), 2491--2510. https://doi.org/10.1007/s10623-024-01400-2 doi:10.1007/s10623-024-01400-2 . https://arxiv.org/abs/2401.13885 arXiv:2401.13885 .arXivDOI
  2. L. Babai, Graph isomorphism in quasipolynomial time , Proceedings of the 48th Annual ACM Symposium on Theory of Computing (STOC 2016), 684--697. https://people.cs.uchicago.edu/ laci/quasi25.pdf Corrected full version 2.5 (2018) .link
  3. A. K. Barnhill, The FAn FA _n conjecture for Coxeter groups , Algebraic & Geometric Topology 6 (2006), 2117--2150. https://doi.org/10.2140/agt.2006.6.2117 doi:10.2140/agt.2006.6.2117 .DOI
  4. J. Baek, D. Conlon, and J. Lee, On the extremal number of incidence graphs , to appear in Journal of Combinatorial Theory, Series B. Preprint: https://arxiv.org/abs/2501.00521v1 arXiv:2501.00521v1 , 2024.arXiv
  5. S. Basu, R. Pollack, and M.-F. Roy, Algorithms in Real Algebraic Geometry , 2nd ed., Algorithms and Computation in Mathematics 10, Springer, 2006. https://doi.org/10.1007/3-540-33099-2 doi:10.1007/3-540-33099-2 .DOI
  6. N. Brady, J. P. McCammond, B. Mühlherr, and W. D. Neumann, Rigidity of Coxeter groups and Artin groups , Geometriae Dedicata 94 (2002), 91--109. https://web.math.ucsb.edu/ mccammon/papers/rigidity.pdf Author manuscript .link
  7. F. R. K. Chung, R. L. Graham, and R. M. Wilson, Quasi-random graphs , Combinatorica 9 (1989), 345--362. https://mathweb.ucsd.edu/ ronspubs/89_05_quasi_graphs.pdf Full text .link
  8. D. Conlon, J. Fox, and B. Sudakov, An approximate version of Sidorenko's conjecture , Geometric and Functional Analysis 20 (2010), 1354--1366. https://doi.org/10.1007/s00039-010-0097-0 doi:10.1007/s00039-010-0097-0 . https://arxiv.org/abs/1004.4236 arXiv:1004.4236 .arXivDOI
  9. D. Conlon, J. H. Kim, C. Lee, and J. Lee, Some advances on Sidorenko's conjecture , Journal of the London Mathematical Society 98 (2018), 593--608. https://doi.org/10.1112/jlms.12142 doi:10.1112/jlms.12142 . https://arxiv.org/abs/1510.06533 arXiv:1510.06533 .arXivDOI
  10. D. Conlon and J. Lee, Finite reflection groups and graph norms , Advances in Mathematics 315 (2017), 130--165. https://doi.org/10.1016/j.aim.2017.05.009 doi:10.1016/j.aim.2017.05.009 . Preprint version used for numbering: https://arxiv.org/abs/1611.05784v2 arXiv:1611.05784v2 .arXivDOI
  11. D. Conlon and J. Lee, Domination inequalities and dominating graphs , Math. Proc. Cambridge Philos. Soc. 177 (2024), 167--184. https://doi.org/10.1017/S0305004124000185 doi:10.1017/S0305004124000185 . https://arxiv.org/abs/2303.01997v2 arXiv:2303.01997v2 .arXivDOI
  12. L. N. Coregliano, Bigraph percolation problems , https://arxiv.org/abs/2408.14257v2 arXiv:2408.14257v2 , 2024.arXiv
  13. L. N. Coregliano, Left-cut-percolation and induced-Sidorenko bigraphs , SIAM J. Discrete Math. 38 (2024), 1586--1629. https://doi.org/10.1137/22M1526794 doi:10.1137/22M1526794 . https://arxiv.org/abs/2205.14703 arXiv:2205.14703 .arXivDOI
  14. M. Doležal, J. Grebḱ, J. Hladký, I. Rocha, and V. Rozhoň, Cut distance identifying graphon parameters over weak* limits , Journal of Combinatorial Theory, Series A 189 (2022), 105615. https://doi.org/10.1016/j.jcta.2022.105615 doi:10.1016/j.jcta.2022.105615 . Preprint: https://arxiv.org/abs/1809.03797v5 arXiv:1809.03797v5 .arXivDOI
  15. D. Eppstein, Reset sequences for monotonic automata , SIAM Journal on Computing 19 (1990), 500--510. https://doi.org/10.1137/0219033 doi:10.1137/0219033 .DOI
  16. M. Fiedler, Algebraic connectivity of graphs , Czechoslovak Mathematical Journal 23 (1973), 298--305. https://dml.cz/handle/10338.dmlcz/101168 Full text .link
  17. F. Garbe, J. Hladký, and J. Lee, Two remarks on graph norms , Discrete & Computational Geometry 67 (2022), 919--929. https://doi.org/10.1007/s00454-021-00280-w doi:10.1007/s00454-021-00280-w .DOI
  18. P. Potočnik, with S. Wilson and other collaborators, Datasets of Highly Symmetric Objects . The locally arc-transitive valence- 3,4 \ 3,4\ and semisymmetric valence-four catalogues, accessed October 2026. r̆l https://graphsym.net/ .link
  19. H. Hatami, Graph norms and Sidorenko's conjecture , Israel Journal of Mathematics 175 (2010), 125--150. https://arxiv.org/abs/0806.0047 arXiv:0806.0047 .arXiv
  20. J. E. Humphreys, Reflection Groups and Coxeter Groups , Cambridge Studies in Advanced Mathematics 29, Cambridge University Press, 1990.
  21. D. Král', T. Martins, P. P. Pach, and M. Wrochna, The step Sidorenko property and non-norming edge-transitive graphs , Journal of Combinatorial Theory, Series A 162 (2019), 34--54. Preprint: https://arxiv.org/abs/1802.05007v4 arXiv:1802.05007v4 .arXiv
  22. J. Lee and B. Schülke, Convex graphon parameters and graph norms , Israel Journal of Mathematics 242 (2021), 549--563. https://doi.org/10.1007/s11856-021-2112-6 doi:10.1007/s11856-021-2112-6 . Preprint: https://arxiv.org/abs/1910.08454v2 arXiv:1910.08454v2 .arXivDOI
  23. L. Lovász, Large Networks and Graph Limits , American Mathematical Society Colloquium Publications 60, American Mathematical Society, Providence, RI, 2012. https://doi.org/10.1090/coll/060 doi:10.1090/coll/060 .DOI
  24. E. M. Luks, Isomorphism of graphs of bounded valence can be tested in polynomial time , Journal of Computer and System Sciences 25 (1982), 42--65. https://doi.org/10.1016/0022-0000(82)90009-5 doi:10.1016/0022-0000(82)90009-5 .DOI
  25. P. Potočnik and S. E. Wilson, Recipes for edge-transitive tetravalent graphs , Art of Discrete and Applied Mathematics 3 (2020), #P1.08. https://doi.org/10.26493/2590-9770.1269.732 doi:10.26493/2590-9770.1269.732 . https://arxiv.org/abs/1608.04158 arXiv:1608.04158 .arXivDOI
  26. Á. Seress, Permutation Group Algorithms , Cambridge Tracts in Mathematics 152, Cambridge University Press, 2003.
  27. A. Sidorenko, A correlation inequality for bipartite graphs , Graphs and Combinatorics 9 (1993), 201--204. https://doi.org/10.1007/BF02988307 doi:10.1007/BF02988307 .DOI
  28. A. Sidorenko, Weakly norming graphs are edge-transitive , Combinatorica 40 (2020), 601--604. https://doi.org/10.1007/s00493-020-4468-3 doi:10.1007/s00493-020-4468-3 . https://arxiv.org/abs/2003.13598 arXiv:2003.13598 .arXivDOI
  29. A. Thomason, Pseudo-random graphs , in Random Graphs '85, North-Holland Mathematics Studies 144, North-Holland, Amsterdam, 1987, 307--331. https://doi.org/10.1016/S0304-0208(08)73063-9 doi:10.1016/S0304-0208(08)73063-9 .DOI

Version history

  1. v1Submitted by Václav RozhoňInitial depositCurrentOct 11, 2026