Graph-different permutations

Simple item page
dc.creatorKörner, János
dc.creatorMalvenuto, Claudia
dc.creatorSimonyi, Gábor
dc.date2007-09-27
dc.date.accessioned2026-07-07T08:32:36Z
dc.date.available2026-07-07T08:32:36Z
dc.descriptionWe 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.
dc.description1+14 pages
dc.identifierhttps://arxiv.org/abs/0709.4387
dc.identifierhttp://arxiv.org/abs/0709.4387
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/138845
dc.subjectCombinatorics
dc.subject05D05, 05A15
dc.titleGraph-different permutations
dc.typetext

Files

Collections

arXiv