Graph-different permutations
classification
🧮 math.CO
keywords
permutationsapproachauthorsbroadercollidingfirstgraph-differentgraphs
read the original abstract
We strengthen and put in a broader perspective previous results of the first two authors on colliding permutations. The key to the present approach is a new non-asymptotic invariant for graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.