no code implementations • 2 Dec 2020 • Irene Heinrich, Thomas Schneider, Pascal Schweitzer
A coloured graph is k-ultrahomogeneous if every isomorphism between two induced subgraphs of order at most k extends to an automorphism.
Combinatorics 05C60, 05B20, 05B05, 05C75