On the Weisfeiler-Leman dimension of permutation graphs

05/25/2023
by   Jin Guo, et al.
0

It is proved that the Weisfeiler-Leman dimension of the class of permutation graphs is at most 18. Previously it was only known that this dimension is finite (Grußien, 2017).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/05/2023

Cryptanalysis of quantum permutation pad

Cryptanalysis increases the level of confidence in cryptographic algorit...
research
05/24/2020

The Weisfeiler-Leman dimension of distance-hereditary graphs

A graph is said to be distance-hereditary if the distance function in ev...
research
07/01/2023

Graphs with Permutation-Representation Number at most Three

In this paper, firstly, we reconcile the graphs with permutation-represe...
research
05/08/2021

On a conjecture on APN permutations

The single trivariate representation proposed in [C. Beierle, C. Carlet,...
research
06/11/2022

Greedy Relaxations of the Sparsest Permutation Algorithm

There has been an increasing interest in methods that exploit permutatio...
research
03/08/2023

Six Permutation Patterns Force Quasirandomness

A sequence π_1,π_2,… of permutations is said to be "quasirandom" if the ...
research
03/26/2020

Linearly Self-Equivalent APN Permutations in Small Dimension

All almost perfect nonlinear (APN) permutations that we know to date adm...

Please sign up or login with your details

Forgot password? Click here to reset