\clearpage
\pdfbookmark[1]{References}{references}
\begin{thebibliography}{99}
\small
\bibitem{ADP}
C. Amarra, A. Devillers, and C. E. Praeger,
\emph{Chain-imprimitive, flag-transitive $2$-designs},
Designs, Codes and Cryptography 92 (2024), 2491--2510.
\href{https://doi.org/10.1007/s10623-024-01400-2}{doi:10.1007/s10623-024-01400-2}.
\href{https://arxiv.org/abs/2401.13885}{arXiv:2401.13885}.

\bibitem{Babai}
L. Babai,
\emph{Graph isomorphism in quasipolynomial time},
Proceedings of the 48th Annual ACM Symposium on Theory of Computing
(STOC 2016), 684--697.
\href{https://people.cs.uchicago.edu/~laci/quasi25.pdf}{Corrected full version 2.5 (2018)}.

\bibitem{Barnhill}
A. K. Barnhill,
\emph{The $\mathrm{FA}_n$ conjecture for Coxeter groups},
Algebraic \& Geometric Topology 6 (2006), 2117--2150.
\href{https://doi.org/10.2140/agt.2006.6.2117}{doi:10.2140/agt.2006.6.2117}.

\bibitem{BCL}
J. Baek, D. Conlon, and J. Lee,
\emph{On the extremal number of incidence graphs},
to appear in Journal of Combinatorial Theory, Series B.
Preprint: \href{https://arxiv.org/abs/2501.00521v1}{arXiv:2501.00521v1}, 2024.

\bibitem{BPR}
S. Basu, R. Pollack, and M.-F. Roy,
\emph{Algorithms in Real Algebraic Geometry},
2nd ed., Algorithms and Computation in Mathematics 10,
Springer, 2006.
\href{https://doi.org/10.1007/3-540-33099-2}{doi:10.1007/3-540-33099-2}.

\bibitem{BMMN}
N. Brady, J. P. McCammond, B. M\"uhlherr, and W. D. Neumann,
\emph{Rigidity of Coxeter groups and Artin groups},
Geometriae Dedicata 94 (2002), 91--109.
\href{https://web.math.ucsb.edu/~mccammon/papers/rigidity.pdf}{Author manuscript}.

\bibitem{CGW}
F. R. K. Chung, R. L. Graham, and R. M. Wilson,
\emph{Quasi-random graphs},
Combinatorica 9 (1989), 345--362.
\href{https://mathweb.ucsd.edu/~ronspubs/89_05_quasi_graphs.pdf}{Full text}.

\bibitem{CFS}
D. Conlon, J. Fox, and B. Sudakov,
\emph{An approximate version of Sidorenko's conjecture},
Geometric and Functional Analysis 20 (2010), 1354--1366.
\href{https://doi.org/10.1007/s00039-010-0097-0}{doi:10.1007/s00039-010-0097-0}.
\href{https://arxiv.org/abs/1004.4236}{arXiv:1004.4236}.

\bibitem{CKLL}
D. Conlon, J. H. Kim, C. Lee, and J. Lee,
\emph{Some advances on Sidorenko's conjecture},
Journal of the London Mathematical Society 98 (2018), 593--608.
\href{https://doi.org/10.1112/jlms.12142}{doi:10.1112/jlms.12142}.
\href{https://arxiv.org/abs/1510.06533}{arXiv:1510.06533}.

\bibitem{CL}
D. Conlon and J. Lee,
\emph{Finite reflection groups and graph norms},
Advances in Mathematics 315 (2017), 130--165.
\href{https://doi.org/10.1016/j.aim.2017.05.009}{doi:10.1016/j.aim.2017.05.009}.
Preprint version used for numbering:
\href{https://arxiv.org/abs/1611.05784v2}{arXiv:1611.05784v2}.

\bibitem{CLdom}
D. Conlon and J. Lee,
\emph{Domination inequalities and dominating graphs},
Math. Proc. Cambridge Philos. Soc. 177 (2024), 167--184.
\href{https://doi.org/10.1017/S0305004124000185}{doi:10.1017/S0305004124000185}.
\href{https://arxiv.org/abs/2303.01997v2}{arXiv:2303.01997v2}.

\bibitem{Coregliano}
L. N. Coregliano,
\emph{Bigraph percolation problems},
\href{https://arxiv.org/abs/2408.14257v2}{arXiv:2408.14257v2}, 2024.

\bibitem{CoreLeft}
L. N. Coregliano,
\emph{Left-cut-percolation and induced-Sidorenko bigraphs},
SIAM J. Discrete Math. 38 (2024), 1586--1629.
\href{https://doi.org/10.1137/22M1526794}{doi:10.1137/22M1526794}.
\href{https://arxiv.org/abs/2205.14703}{arXiv:2205.14703}.

\bibitem{DGRR}
M. Dole\v{z}al, J. Greb\'{\i}k, J. Hladk\'y, I. Rocha, and V. Rozho\v{n},
\emph{Cut distance identifying graphon parameters over weak* limits},
Journal of Combinatorial Theory, Series A 189 (2022), 105615.
\href{https://doi.org/10.1016/j.jcta.2022.105615}{doi:10.1016/j.jcta.2022.105615}.
Preprint: \href{https://arxiv.org/abs/1809.03797v5}{arXiv:1809.03797v5}.

\bibitem{Eppstein}
D. Eppstein,
\emph{Reset sequences for monotonic automata},
SIAM Journal on Computing 19 (1990), 500--510.
\href{https://doi.org/10.1137/0219033}{doi:10.1137/0219033}.

\bibitem{Fiedler}
M. Fiedler,
\emph{Algebraic connectivity of graphs},
Czechoslovak Mathematical Journal 23 (1973), 298--305.
\href{https://dml.cz/handle/10338.dmlcz/101168}{Full text}.

\bibitem{GHL}
F. Garbe, J. Hladk\'y, and J. Lee,
\emph{Two remarks on graph norms},
Discrete \& Computational Geometry 67 (2022), 919--929.
\href{https://doi.org/10.1007/s00454-021-00280-w}{doi:10.1007/s00454-021-00280-w}.

\bibitem{GraphSym}
P. Poto\v{c}nik, with S. Wilson and other collaborators,
\emph{Datasets of Highly Symmetric Objects}.
The locally arc-transitive valence-$\{3,4\}$ and semisymmetric
valence-four catalogues, accessed October 2026.
\url{https://graphsym.net/}.

\bibitem{Hatami}
H. Hatami,
\emph{Graph norms and Sidorenko's conjecture},
Israel Journal of Mathematics 175 (2010), 125--150.
\href{https://arxiv.org/abs/0806.0047}{arXiv:0806.0047}.

\bibitem{Humphreys}
J. E. Humphreys,
\emph{Reflection Groups and Coxeter Groups},
Cambridge Studies in Advanced Mathematics 29,
Cambridge University Press, 1990.

\bibitem{KMPW}
D. Kr\'al', T. Martins, P. P. Pach, and M. Wrochna,
\emph{The step Sidorenko property and non-norming edge-transitive graphs},
Journal of Combinatorial Theory, Series A 162 (2019), 34--54.
Preprint: \href{https://arxiv.org/abs/1802.05007v4}{arXiv:1802.05007v4}.

\bibitem{LS}
J. Lee and B. Sch\"ulke,
\emph{Convex graphon parameters and graph norms},
Israel Journal of Mathematics 242 (2021), 549--563.
\href{https://doi.org/10.1007/s11856-021-2112-6}{doi:10.1007/s11856-021-2112-6}.
Preprint: \href{https://arxiv.org/abs/1910.08454v2}{arXiv:1910.08454v2}.

\bibitem{Lovasz}
L. Lov\'asz,
\emph{Large Networks and Graph Limits},
American Mathematical Society Colloquium Publications 60,
American Mathematical Society, Providence, RI, 2012.
\href{https://doi.org/10.1090/coll/060}{doi:10.1090/coll/060}.

\bibitem{Luks}
E. M. Luks,
\emph{Isomorphism of graphs of bounded valence can be tested in
polynomial time},
Journal of Computer and System Sciences 25 (1982), 42--65.
\href{https://doi.org/10.1016/0022-0000(82)90009-5}{doi:10.1016/0022-0000(82)90009-5}.

\bibitem{PotocnikWilson}
P. Poto\v{c}nik and S. E. Wilson,
\emph{Recipes for edge-transitive tetravalent graphs},
Art of Discrete and Applied Mathematics 3 (2020), \#P1.08.
\href{https://doi.org/10.26493/2590-9770.1269.732}{doi:10.26493/2590-9770.1269.732}.
\href{https://arxiv.org/abs/1608.04158}{arXiv:1608.04158}.

\bibitem{Seress}
\'A. Seress,
\emph{Permutation Group Algorithms},
Cambridge Tracts in Mathematics 152,
Cambridge University Press, 2003.

\bibitem{Sidorenko93}
A. Sidorenko,
\emph{A correlation inequality for bipartite graphs},
Graphs and Combinatorics 9 (1993), 201--204.
\href{https://doi.org/10.1007/BF02988307}{doi:10.1007/BF02988307}.

\bibitem{Sidorenko}
A. Sidorenko,
\emph{Weakly norming graphs are edge-transitive},
Combinatorica 40 (2020), 601--604.
\href{https://doi.org/10.1007/s00493-020-4468-3}{doi:10.1007/s00493-020-4468-3}.
\href{https://arxiv.org/abs/2003.13598}{arXiv:2003.13598}.

\bibitem{Thomason87}
A. Thomason,
\emph{Pseudo-random graphs},
in Random Graphs '85, North-Holland Mathematics Studies 144,
North-Holland, Amsterdam, 1987, 307--331.
\href{https://doi.org/10.1016/S0304-0208(08)73063-9}{doi:10.1016/S0304-0208(08)73063-9}.
\end{thebibliography}