Szymanski's conjecture
id:
szymanski-s-conjecture-298-17063464
title:
Szymanski's conjecture
text:
In mathematics, Szymanski's conjecture, named after Ted H. Szymanski (1989), states that every permutation on the n-dimensional doubly directed hypercube graph can be routed with edge-disjoint paths. That is, if the permutation σ matches each vertex v to another vertex σ(v), then for each v there exists a path in the hypercube graph from v to σ(v) such that no two paths for two different vertices u and v use the same edge in the same direction. Through computer experiments it has been verified t
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Szymanski%27s_conjecture
date created:
date modified:
2023-08-18T23:14:41Z
main entity:
{"identifier":"Q7665039","url":"https://www.wikidata.org/entity/Q7665039"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/c/cb/Szymanski_routing.svg","width":288,"height":279}
fields total:
13
integrity:
14